39 citations · 93 across the 25 of their papers we have counts for
7 papers · 1 filter
The Optimal Pebbling Number of Staircase Graphs
Ervin Győri, Gyula Y. Katona, László F. Papp +1
Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The…
-uniform hypergraphs and linear cycles
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
Gyárfás, Győri and Simonovits proved that if a -uniform hypergraph with vertices has no linear cycles, then its independence number . The hypergraph cons…
Clique Coverings and Claw-free Graphs
Csilla Bujtás, Akbar Davoodi, Ervin Győri +1
Let be a clique covering for and let be a vertex of . The valency of vertex (with respect to ), denoted by , is the number of cl…
An Erdős-Gallai type theorem for uniform hypergraphs
Akbar Davoodi, Ervin Győri, Abhishek Methuku +1
A well-known theorem of Erdős and Gallai asserts that a graph with no path of length contains at most edges. Recently Győri, Katona and Lemons gave an exten…
Note on Terminal-Pairability in Complete Grid Graphs
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-prod…
Terminal-Pairability in Complete Graphs
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph on vertices is termi…
Constructions for the optimal pebbling of grids
Ervin Győri, Gyula Y. Katona, László F. Papp
In [C. Xue, C. Yerger: Optimal Pebbling on Grids, Graphs and Combinatorics] the authors conjecture that if every vertex of an infinite square grid is reachable from a pebble distri…