Metraipolis › archive › dc_fe6c70b397de

Large induced subgraphs with $k$ vertices of maximum degree — arXiv:2609.01681

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01681
License (as archived)
CC0-1.0
Archived
2026-10-17T05:32:45.335Z
SHA-256 of the archived text
e5debdaf9efce3e11b2d0db8f752d618b60da48e29ea03bcdb3354fec8431c8b
Stable URL of this page
https://metraipolis.com/documento/dc_fe6c70b397de

How to cite

Large induced subgraphs with $k$ vertices of maximum degree — arXiv:2609.01681 — arXiv (en), https://arxiv.org/abs/2609.01681 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe6c70b397de (Metraipolis archive dc_fe6c70b397de, sha256 e5debdaf9efce3e11b2d0db8f752d618b60da48e29ea03bcdb3354fec8431c8b)
BibTeX
@misc{dcfe6c70b397de,
  title = {Large induced subgraphs with $k$ vertices of maximum degree — arXiv:2609.01681},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01681},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe6c70b397de; sha256 e5debdaf9efce3e11b2d0db8f752d618b60da48e29ea03bcdb3354fec8431c8b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01681. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that, for every integer $k\ge 2$, there exists a constant $c_k>0$ such that every graph on $n\ge R(k,k)$ vertices with maximum degree $\Delta$ contains an induced subgraph on at least $n-c_k\sqrt{\Delta}$ vertices whose maximum degree is attained by at least $k$ vertices. This confirms a conjecture of Caro and Yuster in strong form.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.01681 — 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-17T04:59:51.751Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).