Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2108.07297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of 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.