39 citations · 111 across the 33 of their papers we have counts for
4 papers · 1 filter
Intersection Graphs of Rays and Grounded Segments
Jean Cardinal, Stefan Felsner, Tillmann Miltzow +2
We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: (…
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…
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…
An upper bound on the size of diamond-free families of sets
Dániel Grósz, Abhishek Methuku, Casey Tompkins
Let be the maximum size of a family of subsets of not containing as a (weak) subposet. The diamond poset, denoted , is defined on four elem…