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
13 papers · 1 filter
The number of triangles is more when they have no common vertex
Chuanqi Xiao, Gyula O. H. Katona
By the theorem of Mantel it is known that a graph with vertices and edges must contain a triangle. A theorem of Erdős gives a strength…
New bounds on even cycle creating Hamiltonian paths using expander graphs
Gergely Harcos, Daniel Soltész
We say that two graphs on the same vertex set are -creating if their union (the union of their edges) contains as a subgraph. Let be the maximum number of pairwise…
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
Ferenc Bencs, Ewan Davies, Viresh Patel +1
For a graph , , and a complex number the partition function of the univariate Potts model is defined as \[ {\bf Z}(G;k,w):=\sum_{ϕ:V\to [k]}\prod_{\su…
Avoiding long Berge cycles, the missing cases and
Beka Ergemlidze, Ervin Győri, Abhishek Methuku +3
The maximum size of an -uniform hypergraph without a Berge cycle of length at least has been determined for all by Füredi, Kostochka and Luo and for (and $…
The maximum number of copies in -free graphs
Ervin Győri, Nika Salia, Casey Tompkins +1
Generalizing Turán's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of copies in an -free graph, for a pair of graphs …
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…
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…
Intersecting -free families
Dániel Gerbner, Abhishek Methuku, Casey Tompkins
We study the problem of determining the size of the largest intersecting -free family for a given partially ordered set (poset) . In particular, we find the exact size of the…
An improvement of the general bound on the largest family of subsets avoiding a subposet
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, and let be the length of a longest chain in .…
On sumsets and convex hull
Karoly Boroczky, Francisco Santos, Oriol Serra
One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recen…