Pages that link to "Item:Q3743337"
From MaRDI portal
The following pages link to The Chromatic Number of Kneser Hypergraphs (Q3743337):
Displaying 37 items.
- On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Hom complexes and hypergraph colorings (Q390395) (← links)
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← 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)
- Transversals to the convex hulls of all \(k\)-sets of discrete subsets of \(\mathbb R^n\) (Q616450) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- A generalized Kneser conjecture (Q750443) (← links)
- On generalized Kneser hypergraph colorings (Q857422) (← links)
- Combinatorial Stokes formulas via minimal resolutions (Q1003649) (← links)
- Large disjoint subgraphs with the same order and size (Q1024273) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Splitting necklaces (Q1097280) (← links)
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings (Q1208342) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- On the generalized Erdős-Kneser conjecture: proofs and reductions (Q1719585) (← links)
- On multicolor Ramsey numbers for loose \(k\)-paths of length three (Q1750208) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Ramsey numbers for partially-ordered sets (Q1789062) (← links)
- Box complexes, neighborhood complexes, and the chromatic number (Q1881691) (← links)
- On characterizing the critical graphs for matching Ramsey numbers (Q2004069) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
- On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell (Q4697504) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs (Q6047961) (← links)
- On the number of star‐shaped classes in optimal colorings of Kneser graphs (Q6143383) (← links)
- Homotopy and Hom construction in the category of finite hypergraphs (Q6166662) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
- Monochromatic spanning trees and matchings in ordered complete graphs (Q6199379) (← links)
