|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Quasigraphs and skeletal partitions | | Tomáš Kaiser
; Petr Vrána
; | | Date: |
31 Dec 2019 | | 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. | | Source: | arXiv, 2001.0037 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER