Pages that link to "Item:Q1882147"
From MaRDI portal
The following pages link to A combinatorical proof of Kneser's conjecture (Q1882147):
Displaying 17 items.
- A topological proof of Chen's alternative Kneser coloring theorem (Q2631607) (← links)
- Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- Combinatorial proof of the minimal excludant theorem (Q3382985) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- A Combinatorial Proof for Stockhausen's Problem (Q4377441) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← 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)
- A generalization of Kneser's conjecture (Q5891501) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)
- On the number of star‐shaped classes in optimal colorings of Kneser graphs (Q6143383) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
- Fair division with allocator's preference (Q6609128) (← links)
