3 citations · 7 across the 14 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.CO2024
Generalized saturation game
Balázs Patkós, Miloš Stojaković, Jelena Stratijev +1
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 comple…
math.CO2024
Edge mappings of graphs: Turán type parameters
Yair Caro, Balázs Patkós, Zsolt Tuza +1
In this paper, we address problems related to parameters concerning edge mappings of graphs. The quantity is defined to be the maximum number of edges in an -vertex gra…
math.CO2024
Edge mappings of graphs: Ramsey type parameters
Yair Caro, Balázs Patkós, Zsolt Tuza +1
In this paper, we launch a systematic study of parameters concerning edge mappings of graphs. Inspired by Ramsey's theorem, the quantity is defined to be the smallest inte…