1.6k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Central European UniversityAT34 papers
- HUN-REN Alfréd Rényi Institute of MathematicsHU24 papers
- Hungarian Academy of SciencesHU23 papers
- Aalto UniversityFI16 papers
- Budapest University of Technology and EconomicsHU14 papers
- Northeastern UniversityUS9 papers
- Harvard UniversityUS7 papers
- Institute for Scientific InterchangeIT7 papers
- Brigham and Women's HospitalUS6 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- Complexity Science HubAT6 papers
- The Alan Turing InstituteGB6 papers
4 papers · 2 filters
An Erdős-Gallai type theorem for vertex colored graphs
Nika Salia, Casey Tompkins, Oscar Zamora
While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on -free graphs. They proved that an…
On the Turán number of some ordered even cycles
Ervin Győri, Dániel Korándi, Abhishek Methuku +3
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…
Turán number of an induced complete bipartite graph plus an odd cycle
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
Let be an integer. We show that if and , or , then the maximum possible number of edges in a -free graph containing no induced copy…
Asymptotics for the Turán number of Berge-
Dániel Gerbner, Abhishek Methuku, Máté Vizer
Let be a graph. A hypergraph is called Berge- if it can be obtained by replacing each edge of by a hyperedge containing it. Let be a family of graphs. The…