Top Open Problems
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
5,373 records · Search and filter
- Math-1851 Problems Around Polynomials — Problem 2
- Math-1852 Problems Around Polynomials — Problem 3
- Math-1853 Problems Around Polynomials — Problem 4
- Math-1854 Problems Around Polynomials — Problem 5
- Math-1855 Problems Around Polynomials — Problem 6
- Math-1856 Problems Around Polynomials — Problem 7
- Math-1857 Research Problems in Function Theory — Problem 4.6
- Math-1858 Research Problems in Function Theory — Problem 4.7
- Math-1859 Research Problems in Function Theory — Problem 4.24
- Math-1860 Research Problems in Function Theory — Problem 4.25
- Math-1861 Research Problems in Function Theory — Problem 4.26
- Math-1862 Research Problems in Function Theory — Problem 4.27
- Math-1863 Research Problems in Function Theory — Problem 4.30
- Math-1864 Research Problems in Function Theory — Problem 5.39
- Math-1865 Research Problems in Function Theory — Problem 5.43
- Math-1866 Research Problems in Function Theory — Problem 5.60
- Math-1867 Research Problems in Function Theory — Problem 5.67
- Math-1868 Achieve global rigidity by pinning nodes
- Math-1869 Acyclic orientation with connectivity prescriptions
- Math-1870 Are t-perfect graphs strongly t-perfect?
- Math-1871 Berge's conjecture on path partitions
- Math-1872 Binary matroid representation of cyclic families
- Math-1873 Bounded degree matroid basis
- Math-1874 Capacitated packing of k-arborescences
- Math-1875 Changing conservative weightings in bipartite graphs
- Math-1876 Chromatic number of t-perfect graphs
- Math-1877 Compatible Euler-tours
- Math-1878 Conforti-Cornuéjols conjecture on the MFMC property
- Math-1879 Covering a crossing supermodular function with graph edges
- Math-1880 Covering a crossing supermodular function with pairwise non-parallel arcs
- Math-1881 Covering a symmetric crossing supermodular function with hyperedges of prescribed size
- Math-1882 Cyclic orderings of matroids
- Math-1883 Deciding kernel-perfectness
- Math-1884 Deciding the validity of the score sequence of a soccer tournament
- Math-1885 Decomposition of oriented k-partition-connected digraphs
- Math-1886 Destroying rigidity
- Math-1887 Disjoint spanning in- and out-arborescences
- Math-1888 Edge-independent spanning trees
- Math-1889 Equitable list colouring
- Math-1890 Exact matching in red-blue bipartite graphs
- Math-1891 Generic global rigidity in three dimensions
- Math-1892 Generic rigidity in three dimensions
- Math-1893 Goddyn's conjecture on thin spanning trees
- Math-1894 Gonality and edge subdivisions
- Math-1895 Head-disjoint strongly connected orientations
- Math-1896 Incomplete splitting-off in digraphs
- Math-1897 Independent arborescences in acyclic digraphs
- Math-1898 Independent trees
- Math-1899 Integer decomposition of smooth polytopes
- Math-1900 List colouring of two matroids