A combinatorical proof of Kneser's conjecture
From MaRDI portal
(Redirected from Publication:1882147)
Recommendations
- A combinatorial proof of a theorem of Katsuura
- Proof of the Combinatorial Kirillov-Reshetikhin Conjecture
- A combinatorial approach for Keller's conjecture
- A combinatorial proof of Louck's conjecture
- A Proof of a Conjecture of Knuth
- A combinatorial proof of a theorem of Freund
- A combinatorial proof of the Burdzy-Pitman conjecture
- scientific article; zbMATH DE number 2124081
- A combinatorial proof of a result of Gessel and Greene
- A combinatorial proof of Frobenius theorem
Cited in
(69)- A new coloring theorem of Kneser graphs
- Fair splitting of colored paths
- On the chromatic number of generalized Kneser hypergraphs
- A constructive proof of Ky Fan's generalization of Tucker's lemma
- On q-analogues and stability theorems
- Hedetniemi's conjecture for Kneser hypergraphs
- On the multichromatic number of \(s\)-stable Kneser graphs
- Coloring properties of categorical product of general Kneser hypergraphs
- Grundy domination and zero forcing in Kneser graphs
- Colorful subhypergraphs in Kneser hypergraphs
- A Combinatorial Proof for Stockhausen's Problem
- On the chromatic number of general Kneser hypergraphs
- Intersection patterns of finite sets and of convex sets
- Chromatic number of random Kneser hypergraphs
- On the number of star‐shaped classes in optimal colorings of Kneser graphs
- The chromatic number of almost stable Kneser hypergraphs
- Short proofs of the Kneser-Lovász coloring principle
- A geometric proof of the colored Tverberg theorem
- Short proofs of the Kneser-Lovász coloring principle
- Large cycles in generalized Johnson graphs
- 2-D Tucker is PPA complete
- Combinatorial Stokes formulas via minimal resolutions
- Matchings with few colors in colored complete graphs and hypergraphs
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
- A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
- Sharp bounds for the chromatic number of random Kneser graphs
- Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\)
- Extremal G-free induced subgraphs of Kneser graphs
- Propositional proofs in Frege and extended Frege systems (abstract)
- A topological proof of Chen's alternative Kneser coloring theorem
- Signature theory in holographic algorithms
- Sparse Kneser graphs are Hamiltonian
- A combinatorial proof of a theorem of Freund
- Arrangements of \(k\)-sets with intersection constraints
- Exact distance graphs of product graphs
- Decomposition of the Kneser graph into paths of length four
- Fair division with allocator's preference
- An integer programming approach for solving a generalized version of the Grundy domination number
- The toughness of Kneser graphs
- scientific article; zbMATH DE number 4075095 (Why is no real title available?)
- A combinatorial proof for the circular chromatic number of Kneser graphs
- Holographic algorithms: from art to science
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
- A combinatorial proof of the skew K-saturation theorem
- On the bandwidth of the Kneser graph
- Combinatorial Stokes formulae
- Choice number of Kneser graphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A generalization of Kneser's conjecture
- The equivariant topology of stable Kneser graphs
- Oriented matroids and Ky Fan's theorem
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
- Generalized Kneser coloring theorems with combinatorial proofs
- Topological combinatorics -- the Kneser conjecture
- Dold's theorem from viewpoint of strong compatibility graphs
- A short proof for Chen's alternative Kneser coloring lemma
- Combinatorial proof of the minimal excludant theorem
- Circular chromatic number of induced subgraphs of Kneser graphs
- Colorful subhypergraphs in uniform hypergraphs
- Topological bounds on the dimension of orthogonal representations of graphs
- New construction of graphs with high chromatic number and small clique number
- Generalised Mycielski graphs and the Borsuk-Ulam theorem
- A combinatorial proof of an infinite version of the Hales-Jewett theorem
- A combinatorial analog of a theorem of F.J. Dyson
- The complexity of finding fair independent sets in cycles
- Altermatic number of categorical product of graphs
- Independence number of products of Kneser graphs
- Computing a small agreeable set of indivisible items
This page was built for publication: A combinatorical proof of Kneser's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882147)
