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-1051 Do any three longest paths in a connected graph have a vertex in common?
- Math-1052 Lovász Path Removal Conjecture
- Math-1053 Switching reconstruction conjecture
- Math-1054 Signing a graph to have small magnitude eigenvalues
- Math-1055 Are almost all graphs determined by their spectrum?
- Math-1056 Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
- Math-1057 3-Decomposition Conjecture
- Math-1058 Cycle Double Covers Containing Predefined 2-Regular Subgraphs
- Math-1059 Sidorenko's Conjecture
- Math-1060 Chromatic number of $\frac{3}{3}$-power of graph
- Math-1061 57-regular Moore graph?
- Math-1062 Half-integral flow polynomial values
- Math-1063 Ramsey properties of Cayley graphs
- Math-1064 Does the chromatic symmetric function distinguish between trees?
- Math-1065 Graham's conjecture on tree reconstruction
- Math-1066 Nearly spanning regular subgraphs
- Math-1067 Domination in cubic graphs
- Math-1068 Friendly partitions
- Math-1069 Subgraph of large average degree and large girth.
- Math-1070 Partitioning edge-connectivity
- Math-1071 Kriesell's Conjecture
- Math-1072 The circular embedding conjecture
- Math-1073 (m,n)-cycle covers
- Math-1074 r-regular graphs are not uniquely hamiltonian.
- Math-1075 Hamiltonian cycles in line graphs
- Math-1076 Jones' conjecture
- Math-1077 Chords of longest cycles
- Math-1078 Hamiltonicity of Cayley graphs
- Math-1079 Strong 5-cycle double cover conjecture
- Math-1080 4-connected graphs are not uniquely hamiltonian
- Math-1081 Hamilton decomposition of prisms over 3-connected cubic planar graphs
- Math-1082 The Berge-Fulkerson conjecture
- Math-1083 The intersection of two perfect matchings
- Math-1084 Matchings extend to Hamiltonian cycles in hypercubes
- Math-1085 Jorgensen's Conjecture
- Math-1086 Seagull problem
- Math-1087 Partition of a cubic 3-connected graphs into paths of length 2.
- Math-1088 4-regular 4-chromatic graphs of high girth
- Math-1089 Coloring the union of degenerate graphs
- Math-1090 List Total Colouring Conjecture
- Math-1091 Petersen coloring conjecture
- Math-1092 Acyclic edge-colouring
- Math-1093 Edge list coloring conjecture
- Math-1094 Pentagon problem
- Math-1095 Mapping planar graphs to odd cycles
- Math-1096 5-flow conjecture
- Math-1097 Jaeger's modular orientation conjecture
- Math-1098 Bouchet's 6-flow conjecture
- Math-1099 The three 4-flows conjecture
- Math-1100 Strong colorability