Dirac-type conditions for spanning bounded-degree hypertrees
Authors:
- Matías Pavez-SignéMPMatías Pavez-Signé
- Nicolás Sanhueza-MatamalaNSNicolás Sanhueza-Matamala
- Maya SteinMSMaya Stein
- 22 November 2023
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 165, 97-141
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Tight cycles and regular slices in dense hypergraphsJournal of Combinatorial Theory, Series A, 2017
- Forbidding Hamilton cycles in uniform hypergraphsJournal of Combinatorial Theory, Series A, 2016
- σ‐algebras for quasirandom hypergraphsRandom Structures & Algorithms, 2016
- Weak hypergraph regularity and linear hypergraphsJournal of Combinatorial Theory, Series B, 2010
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- Spanning Trees in Dense GraphsCombinatorics, Probability and Computing, 2001
- Proof of a Packing Conjecture of BollobásCombinatorics, Probability and Computing, 1995
- Quasi-random graphsCombinatorica, 1989
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952