Dirac-type conditions for spanning bounded-degree hypertrees

DOI10.1016/J.JCTB.2023.11.002MaRDI QIDQ6187344zbMATH OpenOpenAlexFDO

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

Publication date 15 January 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphcodegreetight tree

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Hypergraphs (05C65)

Abstract: We prove that for fixed $k$, every $k$-uniform hypergraph on $n$ vertices and of minimum codegree at least $n/2+o(n)$ contains every spanning tight $k$-tree of bounded vertex degree as a sub-graph. This generalises a well-known result of Koml'os, S'ark"ozy and Szemer'edi for graphs. Our result is asymptotically sharp. We also prove an extension of our result to hypergraphs that satisfy some weak quasirandomness conditions.

Recommendations

• Embedding loose spanning trees in 3-uniform hypergraphs
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 861349 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• σ-algebras for quasirandom hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
• EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Exact solution of some Turán-type problems
• Forbidding Hamilton cycles in uniform hypergraphs
• Hypergraph Turán numbers of linear cycles
• Hypergraphs not containing a tight tree with a bounded trunk
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
• Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
• Minimum degree conditions for tight Hamilton cycles
• On Hamiltonian cycles in hypergraphs with dense link graphs
• On a problem of K. Zarankiewicz
• On extremal problems of graphs and generalized graphs
• Proof of a Packing Conjecture of Bollobás
• Quasi-random graphs
• Quasirandomness in hypergraphs
• Some Theorems on Abstract Graphs
• Spanning surfaces in \(3\)-graphs
• Spanning trees in dense graphs
• Tight cycles and regular slices in dense hypergraphs
• Tight paths in convex geometric hypergraphs
• Tree containment and degree conditions
• Universality for bounded degree spanning trees in randomly perturbed graphs
• Weak hypergraph regularity and linear hypergraphs

Cited in

(2)

• Embedding loose spanning trees in 3-uniform hypergraphs
• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

This page was built for publication: Dirac-type conditions for spanning bounded-degree hypertrees

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