Transversals via regularity

DOI10.1016/J.JCTB.2025.10.004MaRDI QIDQ6862409zbMATH OpenFDO

Authors Yangyang Cheng, Katherine Staden

Publication date 9 February 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.10.004

zbMATH Keywords

blow-up lemmarainbowregularity methodtransversal

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15)

Cites work

• σ-algebras for quasirandom hypergraphs
• A general approach to transversal versions of Dirac‐type theorems
• A hypergraph blow-up lemma
• A rainbow blow-up lemma
• A rainbow blow-up lemma for almost optimally bounded edge-colourings
• A rainbow version of Mantel's theorem
• Blow-up lemma
• Embedding spanning subgraphs in uniformly dense and inseparable graphs
• FF‐factors in Quasi‐random Hypergraphs
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• Fractional and integer matchings in uniform hypergraphs
• Hamilton cycles in quasirandom hypergraphs
• Hamiltonicity in cherry-quasirandom 3-graphs
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• On a rainbow version of Dirac's theorem
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• On circuits in graphs
• On extremal problems of graphs and generalized graphs
• On Ramsey - Turan type theorems for hypergraphs
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Perfect packings in quasirandom hypergraphs. I.
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Quasirandomness in hypergraphs
• Rainbow pancyclicity in graph systems
• Regularity lemmas for hypergraphs and quasi-randomness
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Stability of transversal Hamilton cycles and paths
• The bandwidth theorem for locally dense graphs
• The minimum degree threshold for perfect graph packings
• The poset of hypergraph quasirandomness
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
• Transversal factors and spanning trees
• Transversal Hamilton cycle in hypergraph systems
• Weak hypergraph regularity and linear hypergraphs
• Weak quasi-randomness for uniform hypergraphs

Cited in

(1)

• Transversal Hamilton paths and cycles

This page was built for publication: Transversals via regularity

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