1 problem
- 0 votes0 replies1 view
Matoušek–Valtr conjecture on convexity number and invisibility-graph chromatic number
Let . The invisibility graph of has vertex set , with two points adjacent when they do not see each other through , and let denote i…