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.

中文翻译：

---

伪随机超图匹配

著名的 Pippenger 定理指出，任何具有小余度的几乎正则超图都具有几乎完美的匹配。我们表明，人们可以找到这样一个几乎完美的匹配，它是“伪随机的”，这意味着，例如，匹配包含来自给定边集的边与启发式参数预测的边一样多。