Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth

In this paper, we consider a randomized greedy algorithm for independent sets in r‐uniform d‐regular hypergraphs G on n vertices with girth g. By analyzing the expected size of the independent sets generated by this algorithm, we show that α(G)≥(f(d,r)−ϵ(g,d,r))n, where ϵ(g,d,r) converges to 0 as g ...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms 2021-08, Vol.59 (1), p.79-95
Hauptverfasser:	Nie, Jiaxi, Verstraëte, Jacques
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Differential equations Graph theory Greedy algorithms hypergraphs with large girth independent sets randomized greedy algorithm
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!