5 citations · 15 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Optimal pebbling and rubbling of graphs with given diameter
Ervin Győri, Gyula Y. Katona, László F. Papp
A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a…
math.CO2017
A note on the maximum number of triangles in a -free graph
Beka Ergemlidze, Ervin Győri, Abhishek Methuku +1
We prove that the maximum number of triangles in a -free graph on vertices is at most , improving an estimate of Alon and Shikhelma…