Towards a hypergraph version of the P\'osa-Seymour conjecture

DOI10.19086/AIC.2023.3arXiv2110.09373WikidataQ123213211 ScholiaQ123213211MaRDI QIDQ6380669FDOQ6380669

Authors: Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein 

Publication date: 18 October 2021

Abstract: We prove that for fixed $rgekge2$, every $k$-uniform hypergraph on $n$ vertices having minimum codegree at least $$ contains the $(r-k+1)$th power of a tight Hamilton cycle. This result may be seen as a step towards a hypergraph version of the P'osa--Seymour conjecture. Moreover, we prove that the same bound on the codegree suffices for finding a copy of every spanning hypergraph of tree-width less than $r$ which admits a tree decomposition where every vertex is in a bounded number of bags.

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

This page was built for publication: Towards a hypergraph version of the P\'osa-Seymour conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380669)