Powers of Hamiltonian cycles in multipartite graphs

DOI10.1016/j.disc.2021.112747zbMath1482.05181arXiv2106.11223OpenAlexW4205872222WikidataQ114190566 ScholiaQ114190566MaRDI QIDQ2075502

Louis DeBiasio, Ryan R. Martin, Theodore Molla

Publication date: 14 February 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.11223

zbMATH Keywords

regularityabsorbingmultipartiteextremal embedding problemspowers of Hamiltonian cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On sufficient conditions for spanning structures in dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Tripartite version of the Corrádi-Hajnal theorem
• \(F\)-factors in hypergraphs via absorption
• A multipartite Hajnal-Szemerédi theorem
• On extremal problems of graphs and generalized graphs
• Asymptotic multipartite version of the Alon-Yuster theorem
• Some new results in extremal graph theory
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• Hamiltonian cycles in k‐partite graphs
• An asymptotic bound for the strong chromatic number
• An Asymptotic Multipartite Kühn--Osthus Theorem
• A geometric theory for hypergraph matching

This page was built for publication: Powers of Hamiltonian cycles in multipartite graphs