Pages that link to "Item:Q762489"
From MaRDI portal
The following pages link to Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489):
Displayed 5 items.
- Better bounds for planar sets avoiding unit distances (Q282753) (← links)
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\) (Q604438) (← links)
- Bounds on the measurable chromatic number of \({\mathbb{R}}\) (Q1824627) (← links)
- Same graph, different universe (Q2408074) (← links)
- Winning Fast in Sparse Graph Construction Games (Q3608334) (← links)