Metraipolis › archive › dc_b571c552d578

Spanning subhypergraphs with degree constraints — arXiv:2609.13002

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13002
License (as archived)
CC0-1.0
Archived
2026-10-16T03:49:25.897Z
SHA-256 of the archived text
0d798934216d7754388bf76b7a1e10bfe2d92112b42855bc6116f68cfb4b08d3
Stable URL of this page
https://metraipolis.com/documento/dc_b571c552d578

How to cite

Spanning subhypergraphs with degree constraints — arXiv:2609.13002 — arXiv (en), https://arxiv.org/abs/2609.13002 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b571c552d578 (Metraipolis archive dc_b571c552d578, sha256 0d798934216d7754388bf76b7a1e10bfe2d92112b42855bc6116f68cfb4b08d3)
BibTeX
@misc{dcb571c552d578,
  title = {Spanning subhypergraphs with degree constraints — arXiv:2609.13002},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13002},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b571c552d578; sha256 0d798934216d7754388bf76b7a1e10bfe2d92112b42855bc6116f68cfb4b08d3},
  year = {2026}
}

Archived text

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

An old result of Tutte states that any $d$-regular graph contains a spanning subgraph in which every vertex has degree $k$ or $k+1$, for every $1\leq k\leq d$. We generalize this statement to hypergraphs, showing, for example, that every $3$-uniform $d$-regular hypergraph contains a subgraph in which all degrees are $k, k+1$ or $k+2$, for every $1\leq k\leq d$. This statement is best possible in the sense that the corresponding statement with only two allowed consecutive values is not true. We provide generalizations of this statement to higher uniformities and discuss several open problems.

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