Combinatorics
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.
417 records · Search and filter
- Math-2615 Degree-uniform power saving for intersective polynomial differences
- Math-2616 Polynomial induced removal for ordered binary matrices
- Math-2617 Periodic tilings by bounded measurable sets in three dimensions
- Math-2618 Periodic translational tiling in dimension three
- Math-2619 Five-colorability of the unit-distance plane
- Math-2620 Power saving for prime-intersective polynomial differences
- Math-2621 Quasipolynomial density decay for progression-free sets
- Math-2622 Sharp logarithmic exponents for fixed off-diagonal Ramsey numbers
- Math-2623 Maker winning strategy for Snaky on the infinite square lattice
- Math-2624 Talagrand discrete convexity conjecture
- Math-2625 Sharp terminal edge count in random triangle removal
- Math-2626 Power improvement over the planar unit-distance exponent four thirds
- Math-2627 Weak pinned planar distance assertion
- Math-3042 Large Sum-Free Sets
- Math-3043 Restricted Sumset Problem
- Math-3044 Roth's Theorem with Random Common Differences
- Math-3045 Lipschitz AP-Free Graphs
- Math-3046 Multidimensional Szemerédi Theorem Bounds
- Math-3056 Comparable Elements in Integer Lattices
- Math-3057 Stable Density on Subspaces
- Math-3059 N Queens Problem Asymptotics
- Math-3060 Restricted Sumsets in Partitions
- Math-3061 Sum of Cubes in F_3^n
- Math-3062 Sidon Set Size Bounds
- Math-3063 Disjoint Sumsets Construction
- Math-3087 The Sunflower Conjecture
- Math-3096 Sunflower Conjecture
- Math-3100 Maximum Givens in Minimal Sudoku
- Math-3281 Long rainbow arithmetic progressions
- Math-3282 2-accessibility of primes
- Math-3283 Shuffle-Exchange Conjecture
- Math-3284 Beneš Conjecture
- Math-3294 Sequence defined on multisets
- Math-3295 Transversal achievement game on a square grid
- Math-3296 Roller Coaster permutations
- Math-3297 Saturation in the Hypercube
- Math-3298 Turán Problem for $10$-Cycles in the Hypercube
- Math-3299 Equality in a matroidal circumference bound
- Math-3300 Diagonal Ramsey numbers
- Math-3791 Betti Posets and the Stanley Depth
- Math-3792 Complexity of computing the rotor-router action
- Math-3793 Complexity of the chip-firing reachability problem for general digraphs
- Math-3794 Complexity of the halting problem for Eulerian multigraphs
- Math-3795 Complexity of the halting problem for simple digraphs
- Math-3796 Minimum k-way cut in a hypergraph
- Math-3797 Orientation conjecture of Nash-Williams
- Math-3798 Quasi-kernels and quasi-sinks
- Math-3799 Small quasi-kernels in directed graphs
- Math-3800 Strongly maximal matchings
- Math-3801 Strongly minimal edge cover