Author:
Ehard Stefan,Glock Stefan,Joos Felix
Abstract
AbstractA 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Transversals in Latin Squares;Surveys in Combinatorics 2024;2024-06-13
2. Conflict‐free hypergraph matchings;Journal of the London Mathematical Society;2024-04-29
3. Prague Dimension of Random Graphs;Combinatorica;2023-09-06
4. A proof of the Erdős--Faber--Lovász conjecture;Annals of Mathematics;2023-09-01
5. Threshold for Steiner triple systems;Geometric and Functional Analysis;2023-06-19