Weak saturation numbers in random graphs

For two given graphs $G$ and $F$, a graph $ H$ is said to be weakly $ (G, F) $-saturated if $H$ is a spanning subgraph of $ G$ which has no copy of $F$ as a subgraph and one can add all edges in $ E(G)\setminus E(H)$ to $ H$ in some order so that a new copy of $F$ is created at each step. The weak s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kalinichenko, Olga, Miralaei, Meysam, Mohammadian, Ali, Tayfeh-Rezaie, Behruz
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!