Pages that link to "Item:Q1882147"

The following pages link to A combinatorical proof of Kneser's conjecture (Q1882147):

Displaying 50 items.

• A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
• A combinatorial proof of an infinite version of the Hales-Jewett theorem (Q376553) (← links)
• Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
• On \(q\)-analogues and stability theorems (Q408961) (← links)
• Arrangements of \(k\)-sets with intersection constraints (Q449216) (← links)
• A combinatorial proof of the skew K-saturation theorem (Q468441) (← 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)
• Holographic algorithms: from art to science (Q619900) (← links)
• The equivariant topology of stable Kneser graphs (Q640844) (← links)
• Signature theory in holographic algorithms (Q652529) (← links)
• A geometric proof of the colored Tverberg theorem (Q664361) (← links)
• Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
• A combinatorial analog of a theorem of F.J. Dyson (Q975232) (← links)
• Combinatorial Stokes formulas via minimal resolutions (Q1003649) (← links)
• A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture (Q1378536) (← links)
• Generalized Kneser coloring theorems with combinatorial proofs (Q1608563) (← 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)
• Altermatic number of categorical product of graphs (Q1709531) (← links)
• Independence number of products of Kneser graphs (Q1727773) (← links)
• Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) (Q1752691) (← links)
• A short proof for Chen's alternative Kneser coloring lemma (Q1758510) (← links)
• Oriented matroids and Ky Fan's theorem (Q1945278) (← links)
• 2-D Tucker is PPA complete (Q2009648) (← links)
• An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
• The toughness of Kneser graphs (Q2037560) (← links)
• The complexity of finding fair independent sets in cycles (Q2087771) (← links)
• Choice number of Kneser graphs (Q2166315) (← links)
• Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
• On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
• Exact distance graphs of product graphs (Q2287747) (← links)
• Dold's theorem from viewpoint of strong compatibility graphs (Q2297921) (← links)
• Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
• Computing a small agreeable set of indivisible items (Q2321268) (← links)
• Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
• On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
• Generalised Mycielski graphs and the Borsuk-Ulam theorem (Q2327221) (← links)
• Decomposition of the Kneser graph into paths of length four (Q2342612) (← links)
• On the bandwidth of the Kneser graph (Q2357135) (← 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)
• 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 constructive proof of Ky Fan's generalization of Tucker's lemma (Q2566806) (← links)