Mathematics catalogue
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.
6,275 records · Search and filter
- Math-1851 Research Problems in Function Theory — Problem 5.39
- Math-1852 Research Problems in Function Theory — Problem 5.43
- Math-1853 Research Problems in Function Theory — Problem 5.60
- Math-1854 Research Problems in Function Theory — Problem 5.67
- Math-1855 Achieve global rigidity by pinning nodes
- Math-1856 Acyclic orientation with connectivity prescriptions
- Math-1857 Are t-perfect graphs strongly t-perfect?
- Math-1858 Berge's conjecture on path partitions
- Math-1859 Binary matroid representation of cyclic families
- Math-1860 Bounded degree matroid basis
- Math-1861 Capacitated packing of k-arborescences
- Math-1862 Changing conservative weightings in bipartite graphs
- Math-1863 Chromatic number of t-perfect graphs
- Math-1864 Compatible Euler-tours
- Math-1865 Conforti-Cornuéjols conjecture on the MFMC property
- Math-1866 Covering a crossing supermodular function with graph edges
- Math-1867 Covering a crossing supermodular function with pairwise non-parallel arcs
- Math-1868 Covering a symmetric crossing supermodular function with hyperedges of prescribed size
- Math-1869 Cyclic orderings of matroids
- Math-1870 Deciding kernel-perfectness
- Math-1871 Deciding the validity of the score sequence of a soccer tournament
- Math-1872 Decomposition of oriented k-partition-connected digraphs
- Math-1873 Destroying rigidity
- Math-1874 Disjoint spanning in- and out-arborescences
- Math-1875 Edge-independent spanning trees
- Math-1876 Equitable list colouring
- Math-1877 Exact matching in red-blue bipartite graphs
- Math-1878 Generic global rigidity in three dimensions
- Math-1879 Generic rigidity in three dimensions
- Math-1880 Goddyn's conjecture on thin spanning trees
- Math-1881 Gonality and edge subdivisions
- Math-1882 Head-disjoint strongly connected orientations
- Math-1883 Incomplete splitting-off in digraphs
- Math-1884 Independent arborescences in acyclic digraphs
- Math-1885 Independent trees
- Math-1886 Integer decomposition of smooth polytopes
- Math-1887 List colouring of two matroids
- Math-1888 Local edge-connectivity augmentation of a hypergraph with fixed rank
- Math-1889 Maximum square-free 2-matching
- Math-1890 Maximum weight bounded fractional matching
- Math-1891 Maximum weight k-element subsets of perfect matchings
- Math-1892 Min-sum two edge-disjoint paths
- Math-1893 Opposite vertices of base polyhedra
- Math-1894 Orientation with shortest round trip
- Math-1895 Parity constrained strongly connected orientations
- Math-1896 Partition median problem
- Math-1897 Partitioning a bipartite graph into proportional factors
- Math-1898 Rainbow matchings in bipartite graphs
- Math-1899 Rota's conjecture on disjoint bases
- Math-1900 Scrambled Rota conjecture