E. Györi

activity

20152024

most citedAn Erdős-Gallai type theorem for uniform hypergraphs

39 citations · 93 across the 25 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 2 cited

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem

Ervin Győri, Tamás Róbert Mezei

We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $⌊ \frac{3 n + 4}{16} ⌋$ (simply connected) orthogonal polygons…

math.CO2015

A list version of graph packing

Ervin Győri, Alexandr Kostochka, Andrew McConvey +1

We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \cup V_{2}, E_{3})$ …