Pages that link to "Item:Q2364457"
From MaRDI portal
The following pages link to On chromatic numbers of close-to-Kneser distance graphs (Q2364457):
Displaying 6 items.
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
