Generalized Kneser coloring theorems with combinatorial proofs
From MaRDI portal
Publication:1608563
DOI10.1007/s002220100188zbMath1029.05058arXivmath/0103146OpenAlexW2953006237MaRDI QIDQ1608563
Publication date: 8 August 2002
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0103146
Related Items
The automorphism group of the \(s\)-stable Kneser graphs ⋮ Short Proofs of the Kneser-Lovász Coloring Principle ⋮ The neighborhood complexes of almost \(s\)-stable Kneser graphs ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Short proofs of the Kneser-Lovász coloring principle ⋮ Polytopal complexes: maps, chain complexes and… necklaces ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ On generalized Kneser hypergraph colorings ⋮ Fair splitting of colored paths ⋮ Chromatic number of random Kneser hypergraphs ⋮ Fair splittings by independent sets in sparse graphs ⋮ A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ Hypergraphs with many Kneser colorings ⋮ Oriented matroids and Ky Fan's theorem ⋮ On the chromatic number of Kneser hypergraphs ⋮ A new coloring theorem of Kneser graphs ⋮ Using Brouwer’s Fixed Point Theorem ⋮ New construction of graphs with high chromatic number and small clique number ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ The equivariant topology of stable Kneser graphs ⋮ Lower bounds for the chromatic number of certain Kneser-type hypergraphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Simplotopal maps and necklace splitting ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges ⋮ On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs ⋮ A geometric proof of the colored Tverberg theorem ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Random Kneser graphs and hypergraphs ⋮ Combinatorial Stokes formulae ⋮ Growing balanced covering sets ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ A combinatorial proof of a theorem of Freund ⋮ 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 ⋮ Topological obstructions to graph colorings ⋮ Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property ⋮ Colinear Coloring on Graphs ⋮ Dold's theorem from viewpoint of strong compatibility graphs ⋮ Consensus-halving via theorems of Borsuk-Ulam and Tucker ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ 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 ⋮ The complexity of finding fair independent sets in cycles ⋮ Sparse Kneser graphs are Hamiltonian ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs
This page was built for publication: Generalized Kneser coloring theorems with combinatorial proofs
