On Perfect Matchings in k-Complexes
Keyword(s):
Blow Up
◽
Abstract Keevash and Mycroft [ 19] developed a geometric theory for hypergraph matchings and characterized the dense simplicial complexes that contain a perfect matching. Their proof uses the hypergraph regularity method and the hypergraph blow-up lemma recently developed by Keevash. In this note we give a new proof of their results, which avoids these complex tools. In particular, our proof uses the lattice-based absorbing method developed by the author and a recent probabilistic argument of Kohayakawa, Person, and the author.
2010 ◽
Vol 19
(5-6)
◽
pp. 791-817
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 39
(1)
◽
pp. 273-292
Keyword(s):
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽
2018 ◽
Vol 28
(04)
◽
pp. 1850017
◽
Keyword(s):
2014 ◽
Vol 06
(02)
◽
pp. 1450025
◽
Keyword(s):