Large complete minors in random subgraphs

Let G be a graph of minimum degree at least k and let G p be the random subgraph of G obtained by keeping each edge independently with probability p . We are interested in the size of the largest complete minor that G p contains when p = (1 + ε )/ k with ε > 0. We show that with high probability...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Combinatorics, probability & computing probability & computing, 2021-07, Vol.30 (4), p.619-630
Hauptverfasser:	Erde, Joshua, Kang, Mihyun, Krivelevich, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Completeness Graph theory Graphs Phase transitions Random variables
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!