Dirac-type conditions for spanning bounded-degree hypertrees
From MaRDI portal
Publication:6187344
DOI10.1016/j.jctb.2023.11.002zbMath1530.05138arXiv2012.09824OpenAlexW4388901066MaRDI QIDQ6187344
Matías Pavez-Signé, Maya Jakobine Stein, Nicolás Sanhueza-Matamala
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight cycles and regular slices in dense hypergraphs
- Forbidding Hamilton cycles in uniform hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Weak hypergraph regularity and linear hypergraphs
- Exact solution of some Turán-type problems
- 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
- On extremal problems of graphs and generalized graphs
- Hypergraph Turán numbers of linear cycles
- Spanning Trees in Dense Graphs
- σ-algebras for quasirandom hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Proof of a Packing Conjecture of Bollobás
- Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- Tight paths in convex geometric hypergraphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk
- Some Theorems on Abstract Graphs
- On a problem of K. Zarankiewicz
- Quasi-random graphs
- Quasirandomness in hypergraphs
- Minimum degree conditions for tight Hamilton cycles
This page was built for publication: Dirac-type conditions for spanning bounded-degree hypertrees
