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-3351 Circular flow number of regular class 1 graphs
- Math-3352 Coloring the Odd Distance Graph
- Math-3353 Hedetniemi's Conjecture
- Math-3354 Double-critical graph conjecture
- Math-3355 Are vertex minor closed classes chi-bounded?
- Math-3356 Choice Number of k-Chromatic Graphs of Bounded Order
- Math-3357 Erdős–Faber–Lovász conjecture
- Math-3358 Antidirected trees in digraphs
- Math-3359 Subdivision of a transitive tournament in digraphs with large outdegree.
- Math-3360 Hamilton cycle in small d-diregular graphs
- Math-3361 Erdős-Posa property for long directed cycles
- Math-3362 Monochromatic reachability in arc-colored digraphs
- Math-3363 Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
- Math-3364 Partitionning a tournament into k-strongly connected subtournaments.
- Math-3365 Extremal problem on the number of tree endomorphism
- Math-3366 Odd-cycle transversal in triangle-free graphs
- Math-3367 Multicolour Erdős--Hajnal Conjecture
- Math-3368 PTAS for feedback arc set in tournaments
- Math-3369 ¿Are critical k-forests tight?
- Math-3370 Seymour's self-minor conjecture
- Math-3371 Unions of triangle free graphs
- Math-3372 Universal highly arc transitive digraphs
- Math-3373 Unfriendly partitions
- Math-3374 Highly arc transitive two ended digraphs
- Math-3375 End-Devouring Rays
- Math-3376 Grunbaum's Conjecture
- Math-3377 The Crossing Number of the Hypercube
- Math-3378 What is the largest graph of positive curvature?
- Math-3379 Subgroup formed by elements of order dividing n
- Math-3380 Burnside problem
- Math-3381 Termination of the sixth Goodstein Sequence
- Math-3382 Fixed-point logic with counting
- Math-3383 Order-invariant queries
- Math-3384 Blatter-Specker Theorem for ternary relations
- Math-3385 Finite entailment of Positive Horn logic
- Math-3386 MacEachen Conjecture
- Math-3387 A discrete iteration related to Pierce expansions
- Math-3388 Diophantine quintuple conjecture
- Math-3389 Lucas Numbers Modulo m
- Math-3390 Alexa's Conjecture on Primality
- Math-3391 The Erdos-Turan conjecture on additive bases
- Math-3392 Olson's Conjecture
- Math-3393 Sets with distinct subset sums
- Math-3394 Odd incongruent covering systems
- Math-3395 Covering systems with big moduli
- Math-3396 Divisibility of central binomial coefficients
- Math-3397 Snevily's conjecture
- Math-3398 Counterexamples to the Baillie-PSW primality test
- Math-3399 S(S(f)) = S(f) for reloids
- Math-3400 Rank vs. Genus