Pseudorandom hypergraph matchings Article Swipe
Related Concepts
Stefan Ehard
,
Stefan Glock
,
Felix Joos
·
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.1017/s0963548320000280
· OA: W2962734855
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.1017/s0963548320000280
· OA: W2962734855
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: Hypergraph · Matching (statistics) · Pseudorandomness · Pseudorandom number generator · Mathematics · Combinatorics · Heuristic · Set (abstract data type) · Discrete mathematics · Argument (complex analysis) · Algorithm · Computer science · Mathematical optimization
Related Topics To Compare & Contrast
Finding more related topics…