Author

Lajos Gyõrffy

h-index 2 View on Semantic Scholar

We have 2 of 7 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Chooser-Picker Degree Games for Regular Graphs

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 the remaining edge goes back to Picker. We study the Chooser-Picker (C-P) degree game played on $d$-regular graphs, where Chooser aims to max...

Lajos Gyõrffy · 1 citation

Preprint Aug 2026

Degree Game for Special Regular Graphs

The $d/4$ bound for some infinite graph families, such as the hypercube graph $Q_d$, grids and tori, is improved and it is shown that Breaker can secure a degree of one at every vertex in $Q_3$, then lifted to higher dimensions, where Breaker can guarantee a degree of at least $\lfloor d/3 \rfloor$.

Lajos Gyõrffy · 2 citations