The chromatic profile of locally bipartite graphs
<p>In 1973, Erdős and Simonovits asked whether every <i>n</i>-vertex triangle-free graph with minimum degree greater than 1/3 · <i>n</i> is 3-colourable. This question initiated the study of the chromatic profile of triangle-free graphs: for each <i>k</i>, w...
| Autore principale: | |
|---|---|
| Natura: | Journal article |
| Lingua: | English |
| Pubblicazione: |
Elsevier
2022
|