A Geometric Theory for Hypergraph Matching release_upuiswnpafb4jhpmhmwv5mve2e

by Peter Keevash, Richard Mycroft

Released as a article .

2013  

Abstract

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex geometry, and 'divisibility barriers' from arithmetic lattice-based constructions. To formulate precise results, we introduce the setting of simplicial complexes with minimum degree sequences, which is a generalisation of the usual minimum degree condition. We determine the essentially best possible minimum degree sequence for finding an almost perfect matching. Furthermore, our main result establishes the stability property: under the same degree assumption, if there is no perfect matching then there must be a space or divisibility barrier. This allows the use of the stability method in proving exact results. Besides recovering previous results, we apply our theory to the solution of two open problems on hypergraph packings: the minimum degree threshold for packing tetrahedra in 3-graphs, and Fischer's conjecture on a multipartite form of the Hajnal-Szemer\'edi Theorem. Here we prove the exact result for tetrahedra and the asymptotic result for Fischer's conjecture; since the exact result for the latter is technical we defer it to a subsequent paper.
In text/plain format

Archived Files and Locations

application/pdf  1.1 MB
file_ud4evx7vh5evhmd5xfuindv3la
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  813.9 kB
file_hgrhafisn5d3tixcdxvfvmevgu
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2013-10-09
Version   v2
Language   en ?
arXiv  1108.1757v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: c877a8a8-d273-4c27-b467-c8a1d7c742f8
API URL: JSON