𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On graphs with small subgraphs of large chromatic number

✍ Scribed by V. Rödl; R. A. Duke

Book ID
110567467
Publisher
Springer Japan
Year
1985
Tongue
English
Weight
296 KB
Volume
1
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with subgraphs having large in
On graphs with subgraphs having large independence numbers
✍ Noga Alon; Benny Sudakov 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

## Abstract Let __G__ be a graph on __n__ vertices in which every induced subgraph on ${s}={\log}^{3}\, {n}$ vertices has an independent set of size at least ${t}={\log}\, {n}$. What is the largest ${q}={q}{(n)}$ so that every such __G__ must contain an independent set of size at least __q__? This