Quasigraphs and skeletal partitions
Combinatorics
2022-04-26 v3
Abstract
We give a new proof of the Skeletal Lemma, which is the main technical tool in our paper on Hamilton cycles in line graphs [T. Kaiser and P. Vr\'ana, Hamilton cycles in 5-connected line graphs, European J. Combin. 33 (2012), 924-947]. It generalises results on disjoint spanning trees in graphs to the context of 3-hypergraphs. The lemma is proved in a slightly stronger version that is more suitable for applications. The proof is simplified and formulated in a more accessible way.
Keywords
Cite
@article{arxiv.2001.00037,
title = {Quasigraphs and skeletal partitions},
author = {Tomáš Kaiser and Petr Vrána},
journal= {arXiv preprint arXiv:2001.00037},
year = {2022}
}