Pages that link to "Item:Q490992"
From MaRDI portal
The following pages link to On the chromatic number of general Kneser hypergraphs (Q490992):
Displayed 21 items.
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← 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)
- On the generalized Erdős-Kneser conjecture: proofs and reductions (Q1719585) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs (Q2221931) (← links)
- Dold's theorem from viewpoint of strong compatibility graphs (Q2297921) (← links)
- On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
- On chromatic number and minimum cut (Q2338633) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Lower bounds for the chromatic number of certain Kneser-type hypergraphs (Q2700974) (← links)
- Intersection patterns of finite sets and of convex sets (Q2980804) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)