Metraipolis › archive › dc_9b4669c57b78
The Pairing-Hamiltonian property in Cartesian products of graphs — arXiv:2609.21682
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21682
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:10:31.847Z
- SHA-256 of the archived text
d022c892e66711d3bf5b0dfa3e918c48d4e088fbc62fa8e4954d1446fb649ce2- Stable URL of this page
https://metraipolis.com/documento/dc_9b4669c57b78
How to cite
The Pairing-Hamiltonian property in Cartesian products of graphs — arXiv:2609.21682 — arXiv (en), https://arxiv.org/abs/2609.21682 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b4669c57b78 (Metraipolis archive dc_9b4669c57b78, sha256 d022c892e66711d3bf5b0dfa3e918c48d4e088fbc62fa8e4954d1446fb649ce2)
BibTeX
@misc{dc9b4669c57b78,
title = {The Pairing-Hamiltonian property in Cartesian products of graphs — arXiv:2609.21682},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21682},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b4669c57b78; sha256 d022c892e66711d3bf5b0dfa3e918c48d4e088fbc62fa8e4954d1446fb649ce2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21682. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a simple graph of even order at least four, and let $K_G$ denote the complete graph on $V(G)$. A perfect matching of $K_G$ is called a pairing of $G$. The graph $G$ has the Pairing-Hamiltonian property, or PH-property, if every pairing $M$ of $G$ admits a perfect matching $N\subseteq E(G)$, disjoint from $M$, such that $M\cup N$ is a Hamiltonian cycle of $K_G$. We prove that the PH-property is preserved under Cartesian products. More precisely, for graphs $G$ and $H$ of even order at least four, we show that both $G$ and $H$ are PH if and only if every pairing of $G\square H$ admits a Hamiltonian completion contained in a spanning union of vertex-disjoint prisms determined by a perfect matching of $G$ or of $H$. Without this support restriction, the converse fails: a Cartesian product may be PH even when neither of the two graphs is PH. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.21682 — 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-10T01:48:20.602Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).