Pages that link to "Item:Q1608563"

The following pages link to Generalized Kneser coloring theorems with combinatorial proofs (Q1608563):

Displaying 50 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)
• The automorphism group of the \(s\)-stable Kneser graphs (Q2360724) (← links)
• Fair splitting of colored paths (Q2401427) (← links)
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
• A new coloring theorem of Kneser graphs (Q2431265) (← links)
• Basis theorems for continuous \(n\)-colorings (Q2431608) (← links)
• Simplotopal maps and necklace splitting (Q2439120) (← links)
• Combinatorial Stokes formulae (Q2462340) (← links)
• A combinatorial proof of a theorem of Freund (Q2474499) (← links)
• The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics (Q2497969) (← links)
• A topological proof of Chen's alternative Kneser coloring theorem (Q2631607) (← links)
• Lower bounds for the chromatic number of certain Kneser-type hypergraphs (Q2700974) (← links)
• Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q2701005) (← links)
• Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
• Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property (Q3604997) (← links)
• Colinear Coloring on Graphs (Q3605491) (← links)
• On the chromatic number of Kneser hypergraphs (Q4330574) (← links)
• Using Brouwer’s Fixed Point Theorem (Q4604376) (← links)
• Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)