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
18 papers · 2 filters
On the density of triangles and squares in regular finite and unimodular random graphs
Viktor Harangi
We explicitly describe the possible pairs of triangle and square densities for r-regular finite simple graphs. We also prove that every r-regular unimodular random graph can be app…
A note on traces of set families
Balazs Patkos
A family of sets is defined to be -trace -Sperner if for any -subset of the family of traces $\mathcal{F}|_L=\{F \cap L: F \in \m…
List colorings with distinct list sizes, the case of complete bipartite graphs
Zoltán Füredi, Ida Kantor
Let be a function on the vertex set of the graph . The graph is {\em -choosable} if for every collection of lists with list sizes speci…
Construction of locally plane graphs with many edges
Gábor Tardos
A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most in a geometric graph is self-intersecting we call -loca…
Choosability with separation of complete multipartite graphs and hypergraphs
Zoltán Füredi, Alexandr Kostochka, Mohit Kumbhat
For a hypergraph G and a positive integer s, let χ_{\ell} (G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v\in V(G) and |L(u)\ca…
Optimal Multivalued Shattering
Zoltán Füredi, Attila Sali
We have found the most general extension of the celebrated Sauer, Perles and Shelah, Vapnik and Chervonenkis result from 0-1 sequences to -ary codes still giving a polynomial bo…
On the ratio of maximum and minimum degree in maximal intersecting families
Zoltán Loránt Nagy, Lale Özkahya, Balázs Patkós +1
To study how balanced or unbalanced a maximal intersecting family is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{Δ(\mathcal{F})}{δ(\…
The chromatic gap and its extremes
András Gyárfás, András Sebõ, Nicolas Trotignon
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on …
Coloring half-planes and bottomless rectangles
Balázs Keszegh
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of th…
Path-search in the pyramid and in other graphs
Dániel Gerbner, Balázs Keszegh
We are given an acyclic directed graph with one source, and a subset of its edges which contains exactly one outgoing edge for every non-sink vertex. These edges determine a unique…
Cross-Sperner families
Dániel Gerbner, Nathan Lemons, Cory Palmer +2
A pair of families $(\cF,\cG)$ is said to be \emph{cross-Sperner} if there exists no pair of sets $F \in \cF, G \in \cG$ with or . There are two ways…
Generalizations of the Tree Packing Conjecture
Dániel Gerbner, Balázs Keszegh, Cory Palmer
The Gyárfás tree packing conjecture asserts that any set of trees with vertices has an (edge-disjoint) packing into the complete graph on vertices. Gyárfás and Le…
2-cancellative hypergraphs and codes
Zoltán Füredi
A family of sets F (and the corresponding family of 0-1 vectors) is called t-cancellative if for all distict t+2 members A_1,... A_t and B,C from F the union of A_1,..., A_t and B…
Uniform hypergraphs containing no grids
Zoltán Füredi, Miklós Ruszinkó
A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct…
Large chromatic number and Ramsey graphs
Csaba Biró, Zoltán Füredi, Sogol Jahanbekam
Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is…
Cycle-saturated graphs with minimum number of edges
Zoltan Furedi, Younjin Kim
A graph is called -saturated if it does not contain any copy of , but for any edge in the complement of the graph contains some . The minimum size of an…
Octants are Cover Decomposable
Balázs Keszegh, Dömötör Pálvölgyi
We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two…
Monotone drawings of planar graphs
Janos Pach, Geza Toth
Let G be a graph drawn in the plane so that its edges are represented by x-monotone curves, any pair of which cross an even number of times. We show that G can be redrawn in such a…