Pseudorandom hypergraph matchings
Combinatorics
2020-11-18 v1
Abstract
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance, the matching contains as many edges from a given set of edges as predicted by a heuristic argument.
Keywords
Cite
@article{arxiv.1907.09946,
title = {Pseudorandom hypergraph matchings},
author = {Stefan Ehard and Stefan Glock and Felix Joos},
journal= {arXiv preprint arXiv:1907.09946},
year = {2020}
}
Comments
14 pages