Generalized saturation game

We study the following game version of the generalized graph Turán problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the complete graph Kn such that the graph G of the claimed edges must remain F-free throughout the game. The game ends when no fur...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-04
Hauptverfasser:	Patkós, Balázs, Stojaković, Miloš, Stratijev, Jelena, Máté Vizer
Format:	Artikel
Sprache:	eng
Schlagworte:	Games Graph theory Players
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!