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-1747 Higher additive energy and quantitative stability of the Holder defect
- Math-1748 Reverse Banaszczyk minimization and the ellipsoidal regime
- Math-1749 A linear worst-case lower bound for Ramsey numbers of rectilinear knots
- Math-1750 Polynomial bounds for rectilinear knot Ramsey numbers
- Math-1751 Fixed-polynomial semi-algebraic Ramsey bounds and unbounded-degree universality
- Math-1752 Quantifier-resolved off-diagonal semi-algebraic graph Ramsey numbers
- Math-1753 A small Fano-good tight path and the connectedness convention
- Math-1754 A q-Eulerian last-site law for cycle IDLA
- Math-1755 Naturality as an affine automorphism action
- Math-1756 Periodic Laplacian certificates for robustness and explosion
- Math-1757 A boundary-flux reduction for the mean square-grid sandpile identity
- Math-1758 The full toppling Gröbner fan in the tree case
- Math-1759 Uniform versus torsion-squared higher spanning trees
- Math-1760 Recognizing undirected reduced Laplacian lattices
- Math-1761 An alternating flat family for the complete 3-graph lower bound
- Math-1762 Low temporal repetition forces excess trace
- Math-1763 Temporal trace semantics and a bounded-repetition special case
- Math-1764 Charbit's spectral short-cycle conjecture: the sharp digon case and a Perron-period obstruction
- Math-1765 LP obstructions and cyclic blow-ups for DeVos's distribution conjecture
- Math-1766 An order-statistic form of Shen's deficit conjecture
- Math-1767 Dense nonsumsets and cyclic-interval square roots
- Math-1768 Order lifting for sparse additive bases of polynomial values
- Math-1769 Exponential upper and lower bounds for the additive basis order of multiplicative subgroups
- Math-1770 Cancellation thresholds and a prime-repunit obstruction for multiplicative subgroups
- Math-1771 Direction-complete finite-field sets and quadratic secant lifting
- Math-1772 Finite-field point-line incidences and a projective no-wrap criterion
- Math-1773 A chain-deficit theorem and exact multidimensional constructions for restricted sums
- Math-1774 Exact subgroup self-sumsets and a robust quotient-character leakage bound
- Math-1855 Achieve global rigidity by pinning nodes
- Math-1856 Acyclic orientation with connectivity prescriptions
- Math-1857 Are t-perfect graphs strongly t-perfect?
- Math-1858 Berge's conjecture on path partitions
- Math-1859 Binary matroid representation of cyclic families
- Math-1860 Bounded degree matroid basis
- Math-1861 Capacitated packing of k-arborescences
- Math-1862 Changing conservative weightings in bipartite graphs
- Math-1863 Chromatic number of t-perfect graphs
- Math-1864 Compatible Euler-tours
- Math-1865 Conforti-Cornuéjols conjecture on the MFMC property
- Math-1866 Covering a crossing supermodular function with graph edges
- Math-1867 Covering a crossing supermodular function with pairwise non-parallel arcs
- Math-1868 Covering a symmetric crossing supermodular function with hyperedges of prescribed size
- Math-1869 Cyclic orderings of matroids
- Math-1870 Deciding kernel-perfectness
- Math-1871 Deciding the validity of the score sequence of a soccer tournament
- Math-1872 Decomposition of oriented k-partition-connected digraphs
- Math-1873 Destroying rigidity
- Math-1874 Disjoint spanning in- and out-arborescences
- Math-1875 Edge-independent spanning trees
- Math-1876 Equitable list colouring