Independent sets in subgraphs of a shift graph

Andrii Arman ; Vojtěch Rödl ; Marcelo Tadeu Sales

The electronic journal of combinatorics, Tome 29 (2022) no. 1

Résumé

Erdős, Hajnal and Szemerédi proved that any subset $G$ of vertices of a shift graph $\text{Sh}_{n}^{k}$ has the property that the independence number of the subgraph induced by $G$ satisfies $\alpha(\text{Sh}_{n}^{k}[G])\geq \left(\frac{1}{2}-\varepsilon\right)|G|$, where $\varepsilon\to 0$ as $k\to \infty$. In this note we prove that for $k=2$ and $n \to \infty$ there are graphs $G\subseteq \binom{[n]}{2}$ with $\alpha(\text{Sh}_{n}^{2}[G])\leq \left(\frac{1}{4}+o(1)\right)|G|$, and $\frac{1}{4}$ is best possible. We also consider a related problem for infinite shift graphs.

Détail

DOI : 10.37236/10453

Classification : 05C69, 05C63
Mots-clés : subgraphs of large graphs, chromatic number, finite bipartite graphs