K_4-free graphs have sparse halves
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913534651138048 |
|---|---|
| author | Reiher, Christian |
| author_facet | Reiher, Christian |
| contents | Every $K_4$-free graph on $n$ vertices has a set of $\lfloor n/2\rfloor$ vertices spanning at most $n^2/18$ edges. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2108_07297 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | K_4-free graphs have sparse halves Reiher, Christian Combinatorics Every $K_4$-free graph on $n$ vertices has a set of $\lfloor n/2\rfloor$ vertices spanning at most $n^2/18$ edges. |
| title | K_4-free graphs have sparse halves |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2108.07297 |