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
A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
Zoltán Füredi, Dániel Gerbner, Máté Vizer
There are many generalizations of the Erdős-Ko-Rado theorem. We give new results (and problems) concerning families of -intersecting -element multisets of an -set and poin…
A simple proof of the Zeilberger-Bressoud q-Dyson theorem
Gyula Károlyi, Zoltán Lóránt Nagy
As an application of the Combinatorial Nullstellensatz, we give a short polynomial proof of the q-analogue of Dyson's conjecture formulated by Andrews and first proved by Zeilberge…
A note on the pyjama problem
R. D. Malikiosis, M. Matolcsi, I. Z. Ruzsa
This note concerns the so-called pyjama problem, whether it is possible to cover the plane by finitely many rotations of vertical strips of half-width . We first prove…
Game saturation of intersecting families
Balazs Patkos, Mate Vizer
We consider the following combinatorial game: two players, Fast and Slow, claim -element subsets of alternately, one at each turn, such that both players are…
Nonrepetitive colorings of lexicographic product of graphs
Balázs Keszegh, Balázs Patkós, Xuding Zhu
A coloring of the vertices of a graph is nonrepetitive if there exists no path for which for all . Given graphs a…
Difference sets and positive exponential sums I. General properties
Mate Matolcsi, Imre Z. Ruzsa
We describe general connections between intersective properties of sets in Abelian groups and positive exponential sums. In particular, given a set the maximal size of a set wh…
Octants are Cover-Decomposable into Many Coverings
Balázs Keszegh, Dömötör Pálvölgyi
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a finite num…
Online and quasi-online colorings of wedges and intervals
Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
We consider proper online colorings of hypergraphs defined by geometric regions. We prove that there is an online coloring algorithm that colors intervals of the real line usin…
Regular families of forests, antichains and duality pairs of relational structures
Péter L. Erdős, Dömötör Pálvölgyi, Claude Tardif +1
Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully char…
On the Maximum Number of Edges in a Hypergraph with Given Matching Number
Peter Frankl
The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{\binom(3s+2,3), \binom(n,3) - \binom(…
On the swap-distances of different realizations of a graphical degree sequence
Péter L. Erdős, Zoltán Király, István Miklós
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the…
Density-based group testing
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +1
In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are conside…
AZ-identities and Strict 2-part Sperner Properties of Product Posets
Harout Aydinian, Péter L. Erdős
One of the central issues in extremal set theory is Sperner's theorem and its generalizations. Among such generalizations is the best-known BLYM inequality and the Ahlswede--Zhang…
Linear trees in uniform hypergraphs
Zoltan Furedi
Given a tree T on v vertices and an integer k exceeding one. One can define the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of…
On infinite-finite duality pairs of directed graphs
Péter L. Erdős, Claude Tardif, Gábor Tardos
The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully…
Variants of local algorithms on sparse graphs
Endre Csóka
Suppose we want to construct some structure on a bounded-degree graph, e.g., an almost maximum matching, and we want to decide about each edge depending only on its constant-radius…
Improvement on the decay of crossing numbers
Jakub Černý, Jan Kynčl, Géza Tóth
We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every…
Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
Miklós Abért, Tamás Hubai
We define the chromatic measure of a finite simple graph as the uniform distribution on its chromatic roots. We show that for a Benjamini-Schramm convergent sequence of finite grap…