Pages that link to "Item:Q1608563"
From MaRDI portal
The following pages link to Generalized Kneser coloring theorems with combinatorial proofs (Q1608563):
Displaying 37 items.
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem (Q405143) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← links)
- The chromatic number of almost stable Kneser hypergraphs (Q543913) (← links)
- The equivariant topology of stable Kneser graphs (Q640844) (← links)
- A geometric proof of the colored Tverberg theorem (Q664361) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- On generalized Kneser hypergraph colorings (Q857422) (← links)
- A combinatorial analog of a theorem of F.J. Dyson (Q975232) (← links)
- The neighborhood complexes of almost \(s\)-stable Kneser graphs (Q1633605) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- On the generalized Erdős-Kneser conjecture: proofs and reductions (Q1719585) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
- Oriented matroids and Ky Fan's theorem (Q1945278) (← links)
- Growing balanced covering sets (Q1981677) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs (Q2221931) (← links)
- Dold's theorem from viewpoint of strong compatibility graphs (Q2297921) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- Polytopal complexes: maps, chain complexes and… necklaces (Q5301004) (← links)
- A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs (Q6047961) (← links)
