Pseudorandom hypergraph matchings
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 edge...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
22 July 2020
|
| In: |
Combinatorics, probability & computing
Year: 2020, Volume: 29, Issue: 6, Pages: 868-885 |
| ISSN: | 1469-2163 |
| DOI: | 10.1017/S0963548320000280 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1017/S0963548320000280 Verlag, lizenzpflichtig, Volltext: https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/pseudorandom-hypergraph-matchings/AE0DE17C95900E7DD3F221E2C17FE203 
|
| Author Notes: | Stefan Ehard, Stefan Glock and Felix Joos |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 01.06.2022 |
| Physical Description: | Online Resource |
| ISSN: | 1469-2163 |
| DOI: | 10.1017/S0963548320000280 |