Pages that link to "Item:Q3503465"
From MaRDI portal
The following pages link to On Ramsey Type Problems in Combinatorial Geometry (Q3503465):
Displaying 16 items.
- On the chromatic numbers of spheres in \(\mathbb R^n\) (Q452856) (← links)
- The chromatic number of \(\mathbb R^n\) with a set of forbidden distances (Q542347) (← links)
- The weak zero-one laws for the random distance graphs (Q606499) (← links)
- On the chromatic numbers of spheres in Euclidean spaces (Q610564) (← links)
- New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424) (← links)
- Some analogues of the Borsuk problem in \(\mathbb Q^{n}\) (Q656238) (← links)
- Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\) (Q845157) (← links)
- On geometric graph Ramsey numbers (Q1043821) (← links)
- Ramsey-type results for geometric graphs. II (Q1272962) (← links)
- On the realization of random graphs as distance graphs in spaces of fixed dimension (Q1760937) (← links)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size (Q1761033) (← links)
- Distance graphs with large chromatic number and without large cliques (Q1957062) (← links)
- On the chromatic number of \(\mathbb{R}^{9}\) (Q2451718) (← links)
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861) (← links)
- On the chromatic number of Euclidean space and the Borsuk problem (Q2518013) (← links)
- Ramsey problems for spaces with symmetries (Q2759284) (← links)
