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.
16,859 records · Search and filter
- Math-9251 Are t-perfect graphs strongly t-perfect?
- Math-9252 Berge's conjecture on path partitions
- Math-9253 Binary matroid representation of cyclic families
- Math-9254 Bounded degree matroid basis
- Math-9255 Capacitated packing of k-arborescences
- Math-9256 Changing conservative weightings in bipartite graphs
- Math-9257 Chromatic number of t-perfect graphs
- Math-9258 Compatible Euler-tours
- Math-9259 Conforti-Cornuéjols conjecture on the MFMC property
- Math-9260 Covering a crossing supermodular function with graph edges
- Math-9261 Covering a crossing supermodular function with pairwise non-parallel arcs
- Math-9262 Covering a symmetric crossing supermodular function with hyperedges of prescribed size
- Math-9263 Cyclic orderings of matroids
- Math-9264 Deciding kernel-perfectness
- Math-9265 Deciding the validity of the score sequence of a soccer tournament
- Math-9266 Decomposition of oriented k-partition-connected digraphs
- Math-9267 Destroying rigidity
- Math-9268 Disjoint spanning in- and out-arborescences
- Math-9269 Edge-independent spanning trees
- Math-9270 Equitable list colouring
- Math-9271 Exact matching in red-blue bipartite graphs
- Math-9272 Generic global rigidity in three dimensions
- Math-9273 Generic rigidity in three dimensions
- Math-9274 Goddyn's conjecture on thin spanning trees
- Math-9275 Gonality and edge subdivisions
- Math-9276 Head-disjoint strongly connected orientations
- Math-9277 Incomplete splitting-off in digraphs
- Math-9278 Independent arborescences in acyclic digraphs
- Math-9279 Independent trees
- Math-9280 Integer decomposition of smooth polytopes
- Math-9281 List colouring of two matroids
- Math-9282 Local edge-connectivity augmentation of a hypergraph with fixed rank
- Math-9283 Maximum square-free 2-matching
- Math-9284 Maximum weight bounded fractional matching
- Math-9285 Maximum weight k-element subsets of perfect matchings
- Math-9286 Min-sum two edge-disjoint paths
- Math-9287 Opposite vertices of base polyhedra
- Math-9288 Orientation with shortest round trip
- Math-9289 Parity constrained strongly connected orientations
- Math-9290 Partition median problem
- Math-9291 Partitioning a bipartite graph into proportional factors
- Math-9292 Rainbow matchings in bipartite graphs
- Math-9293 Rota's conjecture on disjoint bases
- Math-9294 Scrambled Rota conjecture
- Math-9295 Serial symmetric exchanges
- Math-9296 Strong colouring of matroid-graph pairs
- Math-9297 Upper bound on common independent set cover
- Math-9298 Weighted bipartite edge colouring
- Math-9299 Fuchsian equations with unitary monodromy
- Math-9300 Accessory parameters of the Heun equation