Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552): Difference between revisions

Let $(F,\rho)$ be a metric space. A distance graph is a graph $G$ with $V(G)\subset F$ and $E(G)=\{(x,y):\rho(x,y)=1\}$. The $(n,k,\varepsilon)$-layer is the set of points $(x_1,\dots,x_{n+k})\in \mathbb{R}^{n+k}$ such that $|x_{i}|<\varepsilon$ for every $i\in\{n+1,\dots,n+k\}$. \par This work gives a relation between the number of vertices $n(G)$, the number of edges $m(G)$ and the independence number $\alpha (G)$ for a distance graph $G$ in a $(2,d,\varepsilon)$-layer. Namely, $m(G)\geq \frac{19-50\lambda}{3}n(G)$ if $\alpha(G)\leq \lambda n(G)$ for some $\lambda\in[\frac{1}{4},\frac{2}{7}]$.