Pseudorandom hypergraph matchings. (22nd November 2020)
- Record Type:
- Journal Article
- Title:
- Pseudorandom hypergraph matchings. (22nd November 2020)
- Main Title:
- Pseudorandom hypergraph matchings
- Authors:
- Ehard, Stefan
Glock, Stefan
Joos, Felix - Abstract:
- 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.
- Is Part Of:
- Combinatorics, probability and computing. Volume 29:Number 6(2020)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 29:Number 6(2020)
- Issue Display:
- Volume 29, Issue 6 (2020)
- Year:
- 2020
- Volume:
- 29
- Issue:
- 6
- Issue Sort Value:
- 2020-0029-0006-0000
- Page Start:
- 868
- Page End:
- 885
- Publication Date:
- 2020-11-22
- Subjects:
- 05C15, -- 05C65, -- 05C70, -- 05D15, -- 05D40
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S0963548320000280 ↗
- Languages:
- English
- ISSNs:
- 0963-5483
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital Store
- Ingest File:
- 16841.xml