A combinatorical proof of Kneser's conjecture
From MaRDI portal
Publication:1882147
DOI10.1007/s00493-004-0011-1zbMath1047.05018OpenAlexW2075508548WikidataQ123342252 ScholiaQ123342252MaRDI QIDQ1882147
Publication date: 19 October 2004
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0011-1
Permutations, words, matrices (05A05) Finite groups of transformations in algebraic topology (including Smith theory) (55M35) Coloring of graphs and hypergraphs (05C15)
Related Items
Short Proofs of the Kneser-Lovász Coloring Principle ⋮ Short proofs of the Kneser-Lovász coloring principle ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Propositional Proofs in Frege and Extended Frege Systems (Abstract) ⋮ Choice number of Kneser graphs ⋮ Fair splitting of colored paths ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Holographic algorithms: from art to science ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ Large cycles in generalized Johnson graphs ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ On \(q\)-analogues and stability theorems ⋮ On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ Fixed-Parameter Algorithms for the Kneser and Schrijver Problems ⋮ Oriented matroids and Ky Fan's theorem ⋮ A new coloring theorem of Kneser graphs ⋮ New construction of graphs with high chromatic number and small clique number ⋮ The equivariant topology of stable Kneser graphs ⋮ Altermatic number of categorical product of graphs ⋮ Arrangements of \(k\)-sets with intersection constraints ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ A generalization of Kneser's conjecture ⋮ Signature theory in holographic algorithms ⋮ On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges ⋮ Independence number of products of Kneser graphs ⋮ A geometric proof of the colored Tverberg theorem ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Combinatorial Stokes formulae ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ The chromatic number of almost stable Kneser hypergraphs ⋮ 2-D Tucker is PPA complete ⋮ A combinatorial analog of a theorem of F.J. Dyson ⋮ The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ An integer programming approach for solving a generalized version of the Grundy domination number ⋮ Exact distance graphs of product graphs ⋮ The toughness of Kneser graphs ⋮ Combinatorial Stokes formulas via minimal resolutions ⋮ Dold's theorem from viewpoint of strong compatibility graphs ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Computing a small agreeable set of indivisible items ⋮ Topological bounds on the dimension of orthogonal representations of graphs ⋮ On the chromatic number of generalized Kneser hypergraphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Generalised Mycielski graphs and the Borsuk-Ulam theorem ⋮ A constructive proof of Ky Fan's generalization of Tucker's lemma ⋮ The complexity of finding fair independent sets in cycles ⋮ Sparse Kneser graphs are Hamiltonian ⋮ Decomposition of the Kneser graph into paths of length four ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs ⋮ On the bandwidth of the Kneser graph
