39 citations · 146 across the 54 of their papers we have counts for
4 papers · 1 filter
On the Linear Cycle Cover Conjecture of Gyárfás and Sárközy
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
A linear cycle in a hypergraph is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are di…
-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…
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…