Metraipolis › archive › dc_ac2319fa9d8a
On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs — arXiv:2610.08042
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08042
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:17.577Z
- SHA-256 of the archived text
fa00e5629e113a8018468fd2a3bca71d4ae4da45399769713d995caf6bb67e9b- Stable URL of this page
https://metraipolis.com/documento/dc_ac2319fa9d8a
How to cite
On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs — arXiv:2610.08042 — arXiv (en), https://arxiv.org/abs/2610.08042 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ac2319fa9d8a (Metraipolis archive dc_ac2319fa9d8a, sha256 fa00e5629e113a8018468fd2a3bca71d4ae4da45399769713d995caf6bb67e9b)
BibTeX
@misc{dcac2319fa9d8a,
title = {On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs — arXiv:2610.08042},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08042},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ac2319fa9d8a; sha256 fa00e5629e113a8018468fd2a3bca71d4ae4da45399769713d995caf6bb67e9b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08042. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we study the existence problem of completely independent spanning trees (CIST) in chordal graphs through appropriate hypergraph representations and their panchromatic and bipanchromatic colorings. First, we disprove a conjecture stating an exact relationship between the panchromatic number, the bipanchromatic number, and the minimum number of unique colors in an optimal panchromatic coloring of a hypergraph. Then, by relating CIST to panchromatic and bipanchromatic colorings of the associated hypergraphs, we derive structural conditions for their existence in chordal graphs and specifically strictly chordal graphs. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM). Pagina del lavoro: https://arxiv.org/abs/2610.08042 — 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-07T11:22:09.560Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).