978 citations
- HUN-REN Alfréd Rényi Institute of MathematicsHU42 papers
- Aalto UniversityFI34 papers
- Central European University - Budapest Campus34 papers
- Complexity Science HubAT31 papers
- Budapest University of Technology and EconomicsHU24 papers
- Hungarian Academy of SciencesHU22 papers
- Institute for Scientific InterchangeIT20 papers
- University of PalermoIT17 papers
- Northeastern UniversityUS16 papers
- Universidad Nacional Autónoma de MéxicoMX15 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Eötvös Loránd UniversityHU12 papers
6 papers · 2 filters
Triangulations and a discrete Brunn-Minkowski inequality in the plane
Károly J. Böröczky, Máté Matolcsi, Imre Z. Ruzsa +2
For a set of points in the plane, not all collinear, we denote by the number of triangles in any triangulation of ; that is, where a…
Rainbow Ramsey problems for the Boolean lattice
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4
We address the following rainbow Ramsey problem: For posets what is the smallest number such that any coloring of the elements of the Boolean lattice either admits…
Linearity of Saturation for Berge Hypergraphs
Sean English, Dániel Gerbner, Abhishek Methuku +1
For a graph , we say a hypergraph is Berge- if it can be obtained from be replacing each edge of with a hyperedge containing it. We say a hypergraph is Berge--…
Vertex Turán problems for the oriented hypercube
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2
In this short note we consider the oriented vertex Turán problem in the hypercube: for a fixed oriented graph , determine the maximum size $ex_v(\overrightarrow…
The distribution of sandpile groups of random regular graphs
András Mészáros
We study the distribution of the sandpile group of random d-regular graphs. For the directed model, we prove that it follows the Cohen-Lenstra heuristics, that is, the limiting pro…
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 …