Embedding loose spanning trees in 3-uniform hypergraphs
From MaRDI portal
Publication:6564604
DOI10.1016/j.jctb.2024.04.003zbMath1542.05121MaRDI QIDQ6564604
Kalina Petrova, Yanitsa Pehova
Publication date: 1 July 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
hypergraphsabsorptionextremal graph theoryspanning treeshypergraph regularity lemmaDirac-type theoremsminimum degree thresholds
Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- The uniformity lemma for hypergraphs
- Matchings in 3-uniform hypergraphs
- Spanning trees of dense directed graphs
- Tree containment and degree conditions
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Spanning trees in dense directed graphs
- Spanning Trees in Dense Graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Regularity lemmas for hypergraphs and quasi-randomness
- On sets of integers containing k elements in arithmetic progression
- Proof of a Packing Conjecture of Bollobás
- Enumeration and randomized constructions of hypertrees
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- On Certain Sets of Integers
- Minimum degree conditions for tight Hamilton cycles
- Dirac-type conditions for spanning bounded-degree hypertrees
This page was built for publication: Embedding loose spanning trees in 3-uniform hypergraphs
