Pages that link to "Item:Q4416417"
From MaRDI portal
The following pages link to A New Short Proof of Kneser's Conjecture (Q4416417):
Displayed 18 items.
- On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- On \(q\)-analogues and stability theorems (Q408961) (← links)
- Probabilistic extensions of the Erdős-Ko-Rado property (Q861532) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) (Q1752691) (← links)
- The toughness of Kneser graphs (Q2037560) (← 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)
- Decomposition of the Kneser graph into paths of length four (Q2342612) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
- Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Assouad-Nagata dimension and gap for ordered metric spaces (Q6058052) (← links)
- On the number of star‐shaped classes in optimal colorings of Kneser graphs (Q6143383) (← links)