Metraipolis › archive › dc_4401cd3b91c9
Maximizing $K_r + I_r$ in graphs with fixed edge density — arXiv:2609.08194
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08194
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:56.317Z
- SHA-256 of the archived text
ea1a93e345bd311933d2faa78e74641b9fceae0d057551719626e93660496e33- Stable URL of this page
https://metraipolis.com/documento/dc_4401cd3b91c9
How to cite
Maximizing $K_r + I_r$ in graphs with fixed edge density — arXiv:2609.08194 — arXiv (en), https://arxiv.org/abs/2609.08194 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4401cd3b91c9 (Metraipolis archive dc_4401cd3b91c9, sha256 ea1a93e345bd311933d2faa78e74641b9fceae0d057551719626e93660496e33)
BibTeX
@misc{dc4401cd3b91c9,
title = {Maximizing $K_r + I_r$ in graphs with fixed edge density — arXiv:2609.08194},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08194},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4401cd3b91c9; sha256 ea1a93e345bd311933d2faa78e74641b9fceae0d057551719626e93660496e33},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08194. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every integer $r\ge4$, and $\rho \in [0,1]$, we asymptotically determine the maximum proportion of $r$-element sets of vertices that induce either a clique or an independent set in a large graph with density $\rho$. This generalizes a result of Olpp for $r=3$. After the initial idea for the main proof was found by the authors, various AI models were used to streamline the argument and perform the calculations necessary for completion of the proof. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.08194 — 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-10-16T14:32:29.845Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).