Combinatorics problems

This area contains 24 revision-pinned source placements and 0 reviewed canonical dossiers. Placements may include aliases or duplicate claims.

Reviewed dossiers

No canonical dossier currently meets the publishability threshold.

Source placement records

• The 1/3–2/3 conjecture
• Dittert conjecture
• Problems in Latin squares
• The lonely runner conjecture
• Superpermutations - smallest possible string of n digits that contains all possible permutations of n
• Map folding
• No-three-in-line problem
• Rudin's conjecture on the number of squares in finite arithmetic progressions
• The sunflower conjecture
• Frankl's union-closed sets conjecture
• Give a combinatorial interpretation of the Kronecker coefficients
• Property B
• Dedekind numbers
• The values of the Ramsey numbers, particularly R ( 5 , 5 ) {\displaystyle R(5,5)} {\displaystyle R(5,5)}
• The values of the Van der Waerden numbers
• Finding a function to model n-step self-avoiding walks
• Erdős sumset conjecture (Joel Moreira, Florian Richter, Donald Robertson, 2018)
• McMullen's g-conjecture
• Hirsch conjecture (Francisco Santos Leal, 2010)
• Gessel's lattice path conjecture (Manuel Kauers, Christoph Koutschan, and Doron Zeilberger, 2009)
• Stanley–Wilf conjecture (Gábor Tardos and Adam Marcus, 2004) (and also the Alon–Friedgut conjecture)
• Kemnitz's conjecture (Christian Reiher, 2003, Carlos di Fiore, 2003)
• Cameron–Erdős conjecture (Ben J. Green, 2003, Alexander Sapozhenko, 2003)