3 papers
math.CO2026
Chooser-Picker Degree Games for Regular Graphs
Lajos Győrffy
In the unbiased Chooser-Picker (also known as Client-Waiter) game played on the edge set of a graph, Picker offers a pair of unclaimed edges in each turn, Chooser claims one, and t…
math.CO2026
Degree Game for Special Regular Graphs
Lajos Győrffy
For a given -regular graph , a Maker-Breaker degree game is played by two players who alternately claim previously unclaimed edges of . In the standard variant, the goal o…
math.CO2025
Partitions of Graphs into Special Bipartite Graphs
Lajos GyÅrffy, András London, Gábor V. Nagy +1
We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to…