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-8401 Erdős Problem #972
- Math-8402 Graphs of exact colorings
- Math-8403 Waring rank of determinant
- Math-8404 $C^r$ Stability Conjecture
- Math-8405 Rainbow AP(4) in an almost equinumerous coloring
- Math-8406 Monotone 4-term Arithmetic Progressions
- Math-8407 Even vs. odd latin squares
- Math-8408 3-accessibility of Fibonacci numbers
- Math-8409 Wide partition conjecture
- Math-8410 Dividing up the unrestricted partitions
- Math-8411 Square achievement game on an n x n grid
- Math-8412 The Double Cap Conjecture
- Math-8413 Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube
- Math-8414 Combinatorial covering designs
- Math-8415 A nowhere-zero point in a linear mapping
- Math-8416 The additive basis conjecture
- Math-8417 The permanent conjecture
- Math-8418 Rota's unimodal conjecture
- Math-8419 Bases of many weights
- Math-8420 Aharoni-Berger conjecture
- Math-8421 Saturated $k$-Sperner Systems of Minimum Size
- Math-8422 The large sets conjecture
- Math-8423 Edge-antipodal colorings of cubes
- Math-8424 Big Line or Big Clique in Planar Point Sets
- Math-8425 Average diameter of a bounded cell of a simple arrangement
- Math-8426 Simplexity of the n-cube
- Math-8427 Kneser–Poulsen conjecture
- Math-8428 Inequality of the means
- Math-8429 Covering a square with unit squares
- Math-8430 Partitioning the Projective Plane
- Math-8431 Chromatic number of associahedron
- Math-8432 Convex Equipartitions with Extreme Perimeter
- Math-8433 Edge-Unfolding Convex Polyhedra
- Math-8434 Fat 4-polytopes
- Math-8435 Cube-Simplex conjecture
- Math-8436 Pebbling a cartesian product
- Math-8437 Edge Reconstruction Conjecture
- Math-8438 Shannon capacity of the seven-cycle
- Math-8439 Star chromatic index of cubic graphs
- Math-8440 Star chromatic index of complete graphs
- Math-8441 Minimal graphs with a prescribed number of spanning trees
- Math-8442 The Borodin-Kostochka Conjecture
- Math-8443 Stable set meeting all longest directed paths.
- Math-8444 Arc-disjoint strongly connected spanning subdigraphs
- Math-8445 Do any three longest paths in a connected graph have a vertex in common?
- Math-8446 Lovász Path Removal Conjecture
- Math-8447 Switching reconstruction conjecture
- Math-8448 Signing a graph to have small magnitude eigenvalues
- Math-8449 Are almost all graphs determined by their spectrum?
- Math-8450 Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament