Metraipolis › archive › dc_2f597a238eea

On spanning trees whose degrees are congruent to one modulo $\ell$ — arXiv:2608.11990

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11990
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:46.407Z
SHA-256 of the archived text
aace62dc1fab2de029fa52e94768873e59578df316f4326bb77c85da62d6b63e
Stable URL of this page
https://metraipolis.com/documento/dc_2f597a238eea

How to cite

On spanning trees whose degrees are congruent to one modulo $\ell$ — arXiv:2608.11990 — arXiv (en), https://arxiv.org/abs/2608.11990 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2f597a238eea (Metraipolis archive dc_2f597a238eea, sha256 aace62dc1fab2de029fa52e94768873e59578df316f4326bb77c85da62d6b63e)
BibTeX
@misc{dc2f597a238eea,
  title = {On spanning trees whose degrees are congruent to one modulo $ell$ — arXiv:2608.11990},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11990},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2f597a238eea; sha256 aace62dc1fab2de029fa52e94768873e59578df316f4326bb77c85da62d6b63e},
  year = {2026}
}

Archived text

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

An $\ell$-congruent spanning tree of a nontrivial connected graph is a spanning tree in which every vertex has degree congruent to one modulo $\ell$. This notion provides a common generalization of classical spanning trees and odd spanning trees. We show, via a constructive greedy algorithm, that every $n$-vertex graph $G$ satisfying $n\equiv2\pmod{\ell}$ and $\delta(G)>\frac{(\ell-1)n}{\ell}$ has an $\ell$-congruent spanning tree. For the special case of odd spanning trees ($\ell=2$), our algorithmic approach simplifies the original proof by Zheng and Wu. We also derive formulas for the numbers of $\ell$-congruent spanning trees in complete graphs and complete bipartite graphs. These formulas specialize to the classical spanning-tree formulas when $\ell=1$ and to the corresponding odd-spanning-tree formulas when $\ell=2$.

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