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-937 Erdős Problem #791
- Math-945 Erdős Problem #812
- Math-946 Erdős Problem #817
- Math-947 Erdős Problem #819
- Math-951 Erdős Problem #826
- Math-953 Erdős Problem #829
- Math-955 Erdős Problem #838
- Math-963 Erdős Problem #864
- Math-965 Erdős Problem #873
- Math-966 Erdős Problem #875
- Math-967 Erdős Problem #876
- Math-989 Erdős Problem #936
- Math-990 Erdős Problem #938
- Math-993 Erdős Problem #943
- Math-996 Erdős Problem #949
- Math-1000 Erdős Problem #959
- Math-1011 Rainbow AP(4) in an almost equinumerous coloring
- Math-1012 Monotone 4-term Arithmetic Progressions
- Math-1013 Even vs. odd latin squares
- Math-1014 3-accessibility of Fibonacci numbers
- Math-1015 Wide partition conjecture
- Math-1016 Dividing up the unrestricted partitions
- Math-1017 Square achievement game on an n x n grid
- Math-1018 The Double Cap Conjecture
- Math-1019 Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube
- Math-1020 Combinatorial covering designs
- Math-1021 A nowhere-zero point in a linear mapping
- Math-1022 The additive basis conjecture
- Math-1023 The permanent conjecture
- Math-1024 Rota's unimodal conjecture
- Math-1025 Bases of many weights
- Math-1026 Aharoni-Berger conjecture
- Math-1027 Saturated $k$-Sperner Systems of Minimum Size
- Math-1028 The large sets conjecture
- Math-1029 Edge-antipodal colorings of cubes
- Math-1338 Perfect 2-error-correcting codes over arbitrary finite alphabets.
- Math-1339 The Alon-Tarsi basis conjecture
- Math-1340 Concavity of van der Waerden numbers
- Math-1537 Tensor growth rate and exact one-dimensional obstructions for constrained differences
- Math-1538 Expansion can hide only global Sidorenko obstructions
- Math-1539 A holonomy reduction to equiangular lines
- Math-1540 Random sub-neighborhood discrepancy on the Boolean cube
- Math-1541 A high-probability lower bound for random permutation discrepancy
- Math-1542 Tusnady's problem: canonical models and monotone-chain certificates
- Math-1543 Link structure and sharp edge bounds for three-edge tight-path-free triple systems
- Math-1544 The minimal empty-core tight path and the 2026 uniformity-four resolution
- Math-1545 The exceptional three-color path problem: star-forest and triangle-density reductions
- Math-1546 A saturated-list kernel for one-point extensions of four-color Ramsey colorings
- Math-1547 Endpoint-deck gluing for one-edge deletion at a 3-uniform Ramsey threshold
- Math-1548 Simplex Ramsey numbers and a robust boundary-extension lemma