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-8451 3-Decomposition Conjecture
- Math-8452 Cycle Double Covers Containing Predefined 2-Regular Subgraphs
- Math-8453 Sidorenko's Conjecture
- Math-8454 Chromatic number of $\frac{3}{3}$-power of graph
- Math-8455 57-regular Moore graph?
- Math-8456 Half-integral flow polynomial values
- Math-8457 Ramsey properties of Cayley graphs
- Math-8458 Does the chromatic symmetric function distinguish between trees?
- Math-8459 Graham's conjecture on tree reconstruction
- Math-8460 Nearly spanning regular subgraphs
- Math-8461 Domination in cubic graphs
- Math-8462 Friendly partitions
- Math-8463 Subgraph of large average degree and large girth.
- Math-8464 Partitioning edge-connectivity
- Math-8465 Kriesell's Conjecture
- Math-8466 The circular embedding conjecture
- Math-8467 (m,n)-cycle covers
- Math-8468 r-regular graphs are not uniquely hamiltonian.
- Math-8469 Hamiltonian cycles in line graphs
- Math-8470 Jones' conjecture
- Math-8471 Chords of longest cycles
- Math-8472 Hamiltonicity of Cayley graphs
- Math-8473 Strong 5-cycle double cover conjecture
- Math-8474 4-connected graphs are not uniquely hamiltonian
- Math-8475 Hamilton decomposition of prisms over 3-connected cubic planar graphs
- Math-8476 The Berge-Fulkerson conjecture
- Math-8477 The intersection of two perfect matchings
- Math-8478 Matchings extend to Hamiltonian cycles in hypercubes
- Math-8479 Jorgensen's Conjecture
- Math-8480 Seagull problem
- Math-8481 Partition of a cubic 3-connected graphs into paths of length 2.
- Math-8482 4-regular 4-chromatic graphs of high girth
- Math-8483 Coloring the union of degenerate graphs
- Math-8484 List Total Colouring Conjecture
- Math-8485 Petersen coloring conjecture
- Math-8486 Acyclic edge-colouring
- Math-8487 Edge list coloring conjecture
- Math-8488 Pentagon problem
- Math-8489 Mapping planar graphs to odd cycles
- Math-8490 5-flow conjecture
- Math-8491 Jaeger's modular orientation conjecture
- Math-8492 Bouchet's 6-flow conjecture
- Math-8493 The three 4-flows conjecture
- Math-8494 Strong colorability
- Math-8495 Reed's omega, delta, and chi conjecture
- Math-8496 Partial List Coloring
- Math-8497 Partial List Coloring
- Math-8498 Bounding the chromatic number of triangle-free graphs with fixed maximum degree
- Math-8499 Graphs with a forbidden induced tree are chi-bounded
- Math-8500 Acyclic list colouring of planar graphs.