Dirac-type conditions for spanning bounded-degree hypertrees

DOI10.1016/J.JCTB.2023.11.002zbMATH Open1530.05138arXiv2012.09824OpenAlexW4388901066MaRDI QIDQ6187344FDOQ6187344

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)

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.

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

Recommendations

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

zbMATH Keywords

hypergraphcodegreetight tree

Mathematics Subject Classification ID

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

Cites Work

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