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-10701 Generalised Empty Hexagon Conjecture
- Math-10702 Continous analogue of Hirsch conjecture
- Math-10703 Book Thickness of Subdivisions
- Math-10704 Number of Cliques in Minor-Closed Classes
- Math-10705 Shuffle-Exchange Conjecture (graph-theoretic form)
- Math-10706 Odd cycles and low oddness
- Math-10707 Beneš Conjecture (graph-theoretic form)
- Math-10708 Finding k-edge-outerplanar graph embeddings
- Math-10709 Vertex Coloring of graph fractional powers
- Math-10710 Matching cut and girth
- Math-10711 Turán number of a finite family.
- Math-10712 Chromatic Number of Common Graphs
- Math-10713 Circular flow numbers of $r$-graphs
- Math-10714 Monochromatic vertex colorings inherited from Perfect Matchings
- Math-10715 Laplacian Degrees of a Graph
- Math-10716 Cores of strongly regular graphs
- Math-10717 Complete bipartite subgraphs of perfect graphs
- Math-10718 Asymptotic Distribution of Form of Polyhedra
- Math-10719 Cycle double cover conjecture
- Math-10720 Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
- Math-10721 Every prism over a 3-connected planar graph is hamiltonian.
- Math-10722 Forcing a 2-regular minor
- Math-10723 Decomposing a connected graph into paths.
- Math-10724 Total Colouring Conjecture
- Math-10725 Seymour's r-graph conjecture
- Math-10726 Goldberg's conjecture
- Math-10727 Strong edge colouring conjecture
- Math-10728 Cores of Cayley graphs
- Math-10729 Weak pentagon problem
- Math-10730 Algorithm for graph homomorphisms
- Math-10731 Real roots of the flow polynomial
- Math-10732 Circular flow number of regular class 1 graphs
- Math-10733 Coloring the Odd Distance Graph
- Math-10734 Hedetniemi's Conjecture
- Math-10735 Double-critical graph conjecture
- Math-10736 Are vertex minor closed classes chi-bounded?
- Math-10737 Choice Number of k-Chromatic Graphs of Bounded Order
- Math-10738 Erdős–Faber–Lovász conjecture
- Math-10739 Antidirected trees in digraphs
- Math-10740 Subdivision of a transitive tournament in digraphs with large outdegree.
- Math-10741 Hamilton cycle in small d-diregular graphs
- Math-10742 Erdős-Posa property for long directed cycles
- Math-10743 Monochromatic reachability in arc-colored digraphs
- Math-10744 Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
- Math-10745 Partitionning a tournament into k-strongly connected subtournaments.
- Math-10746 Extremal problem on the number of tree endomorphism
- Math-10747 Odd-cycle transversal in triangle-free graphs
- Math-10748 Multicolour Erdős--Hajnal Conjecture
- Math-10749 PTAS for feedback arc set in tournaments
- Math-10750 ¿Are critical k-forests tight?