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-1101 Reed's omega, delta, and chi conjecture
- Math-1102 Partial List Coloring
- Math-1103 Partial List Coloring
- Math-1104 Bounding the chromatic number of triangle-free graphs with fixed maximum degree
- Math-1105 Graphs with a forbidden induced tree are chi-bounded
- Math-1106 Acyclic list colouring of planar graphs.
- Math-1107 List chromatic number and maximum degree of bipartite graphs
- Math-1108 Colouring the square of a planar graph
- Math-1109 Bounding the on-line choice number in terms of the choice number
- Math-1110 Choosability of Graph Powers
- Math-1111 2-colouring a graph without a monochromatic maximum clique
- Math-1112 List Colourings of Complete Multipartite Graphs with 2 Big Parts
- Math-1113 Cycles in Graphs of Large Chromatic Number
- Math-1114 The Two Color Conjecture
- Math-1115 The Bermond-Thomassen Conjecture
- Math-1116 Seymour's Second Neighbourhood Conjecture
- Math-1117 Non-edges vs. feedback edge sets in digraphs
- Math-1118 Oriented trees in n-chromatic digraphs
- Math-1119 Directed path of length twice the minimum outdegree
- Math-1120 Caccetta-Häggkvist Conjecture
- Math-1121 Long directed cycles in diregular digraphs
- Math-1122 Arc-disjoint out-branching and in-branching
- Math-1123 Hoàng-Reed Conjecture
- Math-1124 Arc-disjoint directed cycles in regular directed graphs
- Math-1125 Large acyclic induced subdigraph in a planar oriented graph.
- Math-1126 Monochromatic reachability or rainbow triangles
- Math-1127 Decomposing an even tournament in directed paths.
- Math-1128 Decomposing k-arc-strong tournament into k spanning strong digraphs
- Math-1129 Triangle-packing vs triangle edge-transversal.
- Math-1130 The Bollobás-Eldridge-Catlin Conjecture on graph packing
- Math-1131 Weak saturation of the cube in the clique
- Math-1132 Simultaneous partition of hypergraphs
- Math-1133 Turán's problem for hypergraphs
- Math-1134 Coloring random subgraphs
- Math-1135 Negative association in uniform forests
- Math-1136 Chromatic number of random lifts of complete graphs
- Math-1137 Domination in plane triangulations
- Math-1138 Large induced forest in a planar graph.
- Math-1139 Every 4-connected toroidal graph has a Hamilton cycle
- Math-1140 Degenerate colorings of planar graphs
- Math-1141 3-Colourability of Arrangements of Great Circles
- Math-1142 The Crossing Number of the Complete Graph
- Math-1143 The Crossing Number of the Complete Bipartite Graph
- Math-1144 Crossing numbers and coloring
- Math-1145 Are different notions of the crossing number the same?
- Math-1146 Universal point sets for planar graphs
- Math-1147 Which lattices occur as intervals in subgroup lattices of finite groups?
- Math-1148 MSO alternation hierarchy over pictures
- Math-1149 Vertex Cover Integrality Gap
- Math-1150 Chowla's cosine problem