Mathematics
Open problems, research attempts and community review.
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-3301 A conjecture on iterated circumcentres
- Math-3302 Dense rational distance sets in the plane
- Math-3303 Edge-Colouring Geometric Complete Graphs
- Math-3304 Partition of Complete Geometric Graph into Plane Trees
- Math-3305 Dirac's Conjecture
- Math-3306 General position subsets
- Math-3307 Generalised Empty Hexagon Conjecture
- Math-3308 Continous analogue of Hirsch conjecture
- Math-3309 Book Thickness of Subdivisions
- Math-3310 Number of Cliques in Minor-Closed Classes
- Math-3311 Shuffle-Exchange Conjecture (graph-theoretic form)
- Math-3312 Odd cycles and low oddness
- Math-3313 Beneš Conjecture (graph-theoretic form)
- Math-3314 Finding k-edge-outerplanar graph embeddings
- Math-3315 Vertex Coloring of graph fractional powers
- Math-3316 Matching cut and girth
- Math-3317 Turán number of a finite family.
- Math-3318 Chromatic Number of Common Graphs
- Math-3319 Circular flow numbers of $r$-graphs
- Math-3320 Monochromatic vertex colorings inherited from Perfect Matchings
- Math-3321 Laplacian Degrees of a Graph
- Math-3322 Cores of strongly regular graphs
- Math-3323 Complete bipartite subgraphs of perfect graphs
- Math-3324 Asymptotic Distribution of Form of Polyhedra
- Math-3325 Cycle double cover conjecture
- Math-3326 Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
- Math-3327 Every prism over a 3-connected planar graph is hamiltonian.
- Math-3328 Forcing a 2-regular minor
- Math-3329 Decomposing a connected graph into paths.
- Math-3330 Total Colouring Conjecture
- Math-3331 Seymour's r-graph conjecture
- Math-3332 Goldberg's conjecture
- Math-3333 Strong edge colouring conjecture
- Math-3334 Cores of Cayley graphs
- Math-3335 Weak pentagon problem
- Math-3336 Algorithm for graph homomorphisms
- Math-3337 Real roots of the flow polynomial
- Math-3338 Circular flow number of regular class 1 graphs
- Math-3339 Coloring the Odd Distance Graph
- Math-3340 Hedetniemi's Conjecture
- Math-3341 Double-critical graph conjecture
- Math-3342 Are vertex minor closed classes chi-bounded?
- Math-3343 Choice Number of k-Chromatic Graphs of Bounded Order
- Math-3344 Erdős–Faber–Lovász conjecture
- Math-3345 Antidirected trees in digraphs
- Math-3346 Subdivision of a transitive tournament in digraphs with large outdegree.
- Math-3347 Hamilton cycle in small d-diregular graphs
- Math-3348 Erdős-Posa property for long directed cycles
- Math-3349 Monochromatic reachability in arc-colored digraphs
- Math-3350 Edge-disjoint Hamilton cycles in highly strongly connected tournaments.