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
3 papers · 2 filters
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 …