A geometric theory for hypergraph matching

DOI10.1090/memo/1098zbMath1306.05172arXiv1108.1757OpenAlexW2963988718MaRDI QIDQ5497101

Richard Mycroft, Peter Keevash

Publication date: 3 February 2015

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.1757

zbMATH Keywords

hypergraphsperfect matchings

Mathematics Subject Classification ID

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

Related Items (41)

Perfect packings in quasirandom hypergraphs. I. ⋮ Transversal C_k-factors in subgraphs of the balanced blow-up of C_k ⋮ Matching of Given Sizes in Hypergraphs ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Unnamed Item ⋮ On vertex independence number of uniform hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Exact Minimum Codegree Threshold for K⁻₄-Factors ⋮ On the co-degree threshold for the Fano plane ⋮ Almost all Steiner triple systems are almost resolvable ⋮ The Complexity of Perfect Packings in Dense Graphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ Triangle‐factors in pseudorandom graphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Powers of Hamiltonian cycles in multipartite graphs ⋮ Pseudorandom hypergraph matchings ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Cyclic triangle factors in regular tournaments ⋮ \(F\)-factors in hypergraphs via absorption ⋮ Minimum Vertex Degree Threshold for ‐tiling*

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate multipartite version of the Hajnal-Szemerédi theorem
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Tight co-degree condition for perfect matchings in 4-graphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• A randomized embedding algorithm for trees
• Loose Hamilton cycles in hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Supersaturated graphs and hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in 4-uniform hypergraphs
• Quadripartite version of the Hajnal-Szemerédi theorem
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Some intersection theorems for ordered sets and graphs
• An upper bound for the Turán number \(t_3(n,4)\)
• Blow-up lemma
• Tripartite version of the Corrádi-Hajnal theorem
• Uniform edge distribution in hypergraphs is hereditary
• Matchings in 3-uniform hypergraphs
• \(F\)-factors in hypergraphs via absorption
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• A hypergraph blow-up lemma
• On Sets of Acquaintances and Strangers at any Party
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On the Minimal Density of Triangles in Graphs
• Santa Claus Meets Hypergraph Matchings
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• An Ore-type Theorem for Perfect Packings in Graphs
• The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
• The Complexity of Perfect Matching Problems on Dense Hypergraphs
• Embedding large subgraphs into dense graphs
• Degrees giving independent edges in a hypergraph
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• Regularity properties for triple systems
• Extremal problems on set systems
• Regularity Lemma for k-uniform hypergraphs
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• On random sampling in uniform hypergraphs
• Paths, Trees, and Flowers
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Matchings in hypergraphs of large minimum degree
• Polynomial-time perfect matchings in dense hypergraphs
• Some Theorems on Abstract Graphs

This page was built for publication: A geometric theory for hypergraph matching