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,288 records · Search and filter
- Math-3301 Selfridge-Wagstaff-Pomerance Prize Problem
- Math-3302 Kirby Problem 2.42
- Math-3303 Kirby Problem 4.122
- Math-3304 inverse of an integer matrix
- Math-3305 Something like Picard for 1-forms
- Math-3306 Inequality for square summable complex series
- Math-3307 Sequence defined on multisets
- Math-3308 Transversal achievement game on a square grid
- Math-3309 Roller Coaster permutations
- Math-3310 Saturation in the Hypercube
- Math-3311 Turán Problem for $10$-Cycles in the Hypercube
- Math-3312 Equality in a matroidal circumference bound
- Math-3313 Diagonal Ramsey numbers
- Math-3314 A conjecture on iterated circumcentres
- Math-3315 Dense rational distance sets in the plane
- Math-3316 Edge-Colouring Geometric Complete Graphs
- Math-3317 Partition of Complete Geometric Graph into Plane Trees
- Math-3318 Dirac's Conjecture
- Math-3319 General position subsets
- Math-3320 Generalised Empty Hexagon Conjecture
- Math-3321 Continous analogue of Hirsch conjecture
- Math-3322 Book Thickness of Subdivisions
- Math-3323 Number of Cliques in Minor-Closed Classes
- Math-3324 Shuffle-Exchange Conjecture (graph-theoretic form)
- Math-3325 Odd cycles and low oddness
- Math-3326 Beneš Conjecture (graph-theoretic form)
- Math-3327 Finding k-edge-outerplanar graph embeddings
- Math-3328 Vertex Coloring of graph fractional powers
- Math-3329 Matching cut and girth
- Math-3330 Turán number of a finite family.
- Math-3331 Chromatic Number of Common Graphs
- Math-3332 Circular flow numbers of $r$-graphs
- Math-3333 Monochromatic vertex colorings inherited from Perfect Matchings
- Math-3334 Laplacian Degrees of a Graph
- Math-3335 Cores of strongly regular graphs
- Math-3336 Complete bipartite subgraphs of perfect graphs
- Math-3337 Asymptotic Distribution of Form of Polyhedra
- Math-3338 Cycle double cover conjecture
- Math-3339 Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
- Math-3340 Every prism over a 3-connected planar graph is hamiltonian.
- Math-3341 Forcing a 2-regular minor
- Math-3342 Decomposing a connected graph into paths.
- Math-3343 Total Colouring Conjecture
- Math-3344 Seymour's r-graph conjecture
- Math-3345 Goldberg's conjecture
- Math-3346 Strong edge colouring conjecture
- Math-3347 Cores of Cayley graphs
- Math-3348 Weak pentagon problem
- Math-3349 Algorithm for graph homomorphisms
- Math-3350 Real roots of the flow polynomial