Pseudorandom hypergraph matchings

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 s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Combinatorics, probability & computing probability & computing, 2020-11, Vol.29 (6), p.868-885, Article 0963548320000280
Hauptverfasser: Ehard, Stefan, Glock, Stefan, Joos, Felix
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Computer Science, Theory & Methods
Graph theory
Graphs
Matching
Mathematics
Physical Sciences
Pseudorandom
Science & Technology
Statistics & Probability
Technology
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0963-5483
1469-2163
DOI:10.1017/S0963548320000280