Pages that link to "Item:Q5412823"
From MaRDI portal
The following pages link to Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers (Q5412823):
Displaying 11 items.
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Intersection theorems for \((- 1, 0, 1)\)-vectors (Q6181997) (← links)
