Fractional and integer matchings in uniform hypergraphs

DOI10.1016/J.EJC.2013.11.006MaRDI QIDQ6828676zbMATH OpenFDO

Authors Daniela Kühn, Deryk Osthus, Timothy Townsend

Publication date 10 February 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2013.11.006

zbMATH Keywords

\(k\)-uniform hypergraphperfect matching

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(4)

• Transversals via regularity
• On the Keevash-Knox-Mycroft conjecture
• Matchings in multipartite hypergraphs
• Matching stability for 3-partite 3-uniform hypergraphs

This page was built for publication: Fractional and integer matchings in uniform hypergraphs

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