857 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Hungarian Academy of SciencesHU402 papers
- Eötvös Loránd UniversityHU156 papers
- Budapest University of Technology and EconomicsHU58 papers
- Central European UniversityAT42 papers
- École Polytechnique Fédérale de LausanneCH31 papers
- Central European University - Budapest Campus24 papers
- University of PannoniaHU23 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- University College LondonGB20 papers
- University of SzegedHU20 papers
- University of Illinois Urbana-ChampaignUS18 papers
- Charles UniversityCZ15 papers
20 papers · 2 filters
Finding non-minority balls with majority and plurality queries
Huilan Chang, Dániel Gerbner, Balázs Patkós
Given a set of colored balls, a \textit{majority, non-minority or plurality ball} is one whose color class has size more than , at least or larger than any other col…
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…
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…
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…
Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness
Ivailo Hartarsky, Tamás Róbert Mezei
Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three rough universality classes, the most studie…
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 $…
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…
Avoiding long Berge cycles II, exact bounds for all
Zoltan Furedi, Alexandr Kostochka, Ruth Luo
Let denote the maximum number of edges in an -vertex -uniform hypergraph with no Berge cycles of length or longer. In the first part of this work, we have fou…
A stability theorem on cube tessellations
Peter Frankl, Janos Pach
It is shown that if a -dimensional cube is decomposed into n cubes, the side lengths of which belong to the interval n$ is a perfec…
A note on Ramsey numbers for Berge-G hyper graphs
Maria Axenovich, Andras Gyarfas
For a graph G=(V,E), a hypergraph H is called Berge-G if there is a bijection f from E(G) to E(H) such that for each e in E(G), e is a subset of f(e). The set of all Berge-G hyperg…
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…
Avoiding long Berge cycles
Zoltan Furedi, Alexandr Kostochka, Ruth Luo
Let and be an -vertex -uniform hypergraph. We show that if then contains a Berge cyc…
Counting copies of a fixed subgraph in -free graphs
Dániel Gerbner, Cory Palmer
Fix graphs and and let denote the maximum possible number of copies of the graph in an -vertex -free graph. The systematic study of this function was…
New inequalities for families without k pairwise disjoint members
Peter Frankl, Andrey Kupavskii
Some best possible inequalities are established for k-partition-free families (cf. Definition 1) and they are applied to prove a sharpening of a classical result of Kleitman concer…
Not all phylogenetic networks are leaf-reconstructible
Péter L. Erdős, Leo van Iersel, Mark Jones
Unrooted phylogenetic networks are graphs used to represent evolutionary relationships. Accurately reconstructing such networks is of great relevance for evolutionary biology. It h…
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 …
Minimal toughness in special graph classes
Gyula Y. Katona, Kitti Varga
Let be a positive real number. A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components, and all graphs are…
On the size of the set
Oliver Roche-Newton, Imre Z. Ruzsa, Chun-Yen Shen +1
It is established that there exists an absolute constant such that for any finite set of positive real numbers On the other hand, we g…
Finite projective planes and the Delsarte LP-bound
Mate Matolcsi, Mihaly Weiner
We apply an improvement of the Delsarte LP-bound to give a new proof of the non-existence of finite projective planes of order 6, and uniqueness of finite projective planes of orde…