Dirac's theorem for linear hypergraphs

DOI10.1137/24M1659467MaRDI QIDQ6986955zbMATH OpenFDO

Authors Seonghyuk Im, Hyun Woo Lee

Publication date 7 May 2025

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1659467

zbMATH Keywords

Dirac-type theoremfractional matchinglinear hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
• Asymptotic behavior of the chromatic index for hypergraphs
• Conflict-free hypergraph matchings
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Embedding hypertrees into Steiner triple systems
• Embedding large subgraphs into dense graphs
• Embedding loose spanning trees in 3-uniform hypergraphs
• Embedding spanning trees in random graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• High-girth Steiner triple systems
• scientific article; zbMATH DE number 1286511 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• scientific article; zbMATH DE number 3069630 (Why is no real title available?)
• Large girth approximate Steiner triple systems
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Loose Hamilton cycles in hypergraphs
• Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• On a conjecture of Erdős on locally sparse Steiner triple systems
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• Optimal spread for spanning subgraphs of Dirac hypergraphs
• Packing paths in Steiner triple systems
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Proof of a Packing Conjecture of Bollobás
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Recent advances on Dirac-type problems for hypergraphs
• Some Theorems on Abstract Graphs
• Spanning trees in dense graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Thresholds versus fractional expectation-thresholds
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs

This page was built for publication: Dirac's theorem for linear hypergraphs

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