E. Györi

most citedOn the number of edge-disjoint triangles in

K_{4}

-free graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

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 $C_{5}$ -free graph

Beka Ergemlidze, Ervin Győri, Abhishek Methuku +1

We prove that the maximum number of triangles in a $C_{5}$ -free graph on $n$ vertices is at most $\frac{1}{2 2} (1 + o (1)) n^{3/2}$ , improving an estimate of Alon and Shikhelma…

math.CO2015★ 1 cited

On the number of edge-disjoint triangles in $K_{4}$ -free graphs

Ervin Győri, Balázs Keszegh

We show the quarter of a century old conjecture that every $K_{4}$ -free graph with $n$ vertices and $⌊ n^{2} /4 ⌋ + k$ edges contains $k$ pairwise edge disjoint triangles.

Optimal pebbling and rubbling of graphs with given diameter

A note on the maximum number of triangles in a C5​-free graph

On the number of edge-disjoint triangles in K4​-free graphs

A note on the maximum number of triangles in a $C_{5}$ -free graph

On the number of edge-disjoint triangles in $K_{4}$ -free graphs