25 search results - page 1 / 5 » A Combinatorial Proof of Kneser's Conjecture |
COMBINATORICA
2004
13 years 6 months ago
2004
ISVD
2007
IEEE
14 years 11 days ago
2007
IEEE
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
JCT
2006
13 years 6 months ago
2006
We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in (pn). Here denotes the Bergeron-Garsia nabla operator, and pn is a...
COMBINATORICS
2004
13 years 6 months ago
2004
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...