Metraipolis › archive › dc_cb82c4e22a45
Seeking the dense half in $K_4$-free graphs — arXiv:2611.07082
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07082
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:52:37.692Z
- SHA-256 of the archived text
b1fc1d1488a32370c097cd98a2bfe9059bc4d3329e427b2b14af70698c5b208d- Stable URL of this page
https://metraipolis.com/documento/dc_cb82c4e22a45
How to cite
Seeking the dense half in $K_4$-free graphs — arXiv:2611.07082 — arXiv (en), https://arxiv.org/abs/2611.07082 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb82c4e22a45 (Metraipolis archive dc_cb82c4e22a45, sha256 b1fc1d1488a32370c097cd98a2bfe9059bc4d3329e427b2b14af70698c5b208d)
BibTeX
@misc{dccb82c4e22a45,
title = {Seeking the dense half in $K_4$-free graphs — arXiv:2611.07082},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07082},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb82c4e22a45; sha256 b1fc1d1488a32370c097cd98a2bfe9059bc4d3329e427b2b14af70698c5b208d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07082. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that every $K_4$-free graph on $n$ vertices has a balanced bipartition such that neither part contains more than $0.0671n^2 + o(n^2)$ edges. This improves the previous best bound of $0.074n^2$ by Xu and Zhang. We also formulate a conjecture that the tight bound for this problem is $\frac{425}{6498}n^2 \approx 0.0654n^2$, and present a construction showing that it would be best possible.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.07082 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:27.836Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).