Top Open Problems
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.
5,428 records · Search and filter
- Math-3351 Shuffle-Exchange Conjecture
- Math-3352 Beneš Conjecture
- Math-3353 Suslin's Problem
- Math-3354 The Guralnick-Thompson Conjecture
- Math-3355 Giuga's Conjecture on Prime Characterization
- Math-3356 Selfridge-Wagstaff-Pomerance Prize Problem
- Math-3357 Kirby Problem 2.42
- Math-3358 Kirby Problem 4.122
- Math-3359 inverse of an integer matrix
- Math-3360 Something like Picard for 1-forms
- Math-3361 Inequality for square summable complex series
- Math-3362 Sequence defined on multisets
- Math-3363 Transversal achievement game on a square grid
- Math-3364 Roller Coaster permutations
- Math-3365 Saturation in the Hypercube
- Math-3366 Turán Problem for $10$-Cycles in the Hypercube
- Math-3367 Equality in a matroidal circumference bound
- Math-3368 Diagonal Ramsey numbers
- Math-3369 A conjecture on iterated circumcentres
- Math-3370 Dense rational distance sets in the plane
- Math-3371 Edge-Colouring Geometric Complete Graphs
- Math-3372 Partition of Complete Geometric Graph into Plane Trees
- Math-3373 Dirac's Conjecture
- Math-3374 General position subsets
- Math-3375 Generalised Empty Hexagon Conjecture
- Math-3376 Continous analogue of Hirsch conjecture
- Math-3377 Book Thickness of Subdivisions
- Math-3378 Number of Cliques in Minor-Closed Classes
- Math-3379 Shuffle-Exchange Conjecture (graph-theoretic form)
- Math-3380 Odd cycles and low oddness
- Math-3381 Beneš Conjecture (graph-theoretic form)
- Math-3382 Finding k-edge-outerplanar graph embeddings
- Math-3383 Vertex Coloring of graph fractional powers
- Math-3384 Matching cut and girth
- Math-3385 Turán number of a finite family.
- Math-3386 Chromatic Number of Common Graphs
- Math-3387 Circular flow numbers of $r$-graphs
- Math-3388 Monochromatic vertex colorings inherited from Perfect Matchings
- Math-3389 Laplacian Degrees of a Graph
- Math-3390 Cores of strongly regular graphs
- Math-3391 Complete bipartite subgraphs of perfect graphs
- Math-3392 Asymptotic Distribution of Form of Polyhedra
- Math-3393 Cycle double cover conjecture
- Math-3394 Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
- Math-3395 Every prism over a 3-connected planar graph is hamiltonian.
- Math-3396 Forcing a 2-regular minor
- Math-3397 Decomposing a connected graph into paths.
- Math-3398 Total Colouring Conjecture
- Math-3399 Seymour's r-graph conjecture
- Math-3400 Goldberg's conjecture