Pseudorandom hypergraph matchings
arXiv:1907.09946 · doi:10.1017/S0963548320000280
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.
14 pages