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
31 papers · 2 filters
A new approach to constant term identities and Selberg-type integrals
Gyula Károlyi, Zoltán Lóránt Nagy, Fedor Petrov +1
Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. B…
Uniformly resolvable decompositions of into and graphs
Salvatore Milici, Zsolt Tuza
In this paper we consider the uniformly resolvable decompositions of the complete graph , or the complete graph minus a 1-factor as appropriate, into subgraphs such that each…
Crossing numbers and combinatorial characterization of monotone drawings of
Martin Balko, Radoslav Fulek, Jan Kynčl
In 1958, Hill conjectured that the minimum number of crossings in a drawing of is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…
Covering Paths and Trees for Planar Grids
Balázs Keszegh
Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We sh…
Approximability of the upper chromatic number of hypergraphs
Csilla Bujtás, Zsolt Tuza
A C-coloring of a hypergraph is a vertex coloring such that each edge has at least two vertices with a common color. T…
Maximum uniformly resolvable decompositions of and into 3-stars and 3-cycles
Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza
Let denote the complete graph of order and denote minus a 1-factor. In this article we investigate uniformly resolvable decompositions of and $K_v-I…
Total Transversals and Total Domination in Uniform Hypergraphs
Csilla Bujtás, Michael A. Henning, Zsolt Tuza +1
The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this…
Extremal numbers for odd cycles
Zoltan Füredi, David S. Gunderson
We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1})…
Topological orderings of weighted directed acyclic graphs
Dániel Gerbner, Balázs Keszegh, Cory Palmer +1
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate…
Incomparable copies of a poset in the Boolean lattice
Gyula O. H. Katona, Dániel T. Nagy
Let be the poset generated by the subsets of with the inclusion as relation and let be a finite poset. We want to embed into as many times as possible suc…
Search Problems in Vector Spaces
Tamás Héger, Balázs Patkós, Marcella Takáts
We consider the following -analog of the basic combinatorial search problem: let be a prime power and $\GF(q)$ the finite field of elements. Let denote an -dimens…
Saturated simple and -simple topological graphs
Jan Kynčl, János Pach, Radoš Radoičić +1
A simple topological graph is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. is ca…
Coloring 2-intersecting hypergraphs
Lucas Colucci, András Gyárfás
A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-i…
On sumsets and convex hull
Karoly Boroczky, Francisco Santos, Oriol Serra
One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recen…
Problems and memories
András Gyárfás
I state some open problems coming from joint work with Paul Erdős
The history of degenerate (bipartite) extremal graph problems
Zoltán Füredi, Miklós Simonovits
This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and…
Relations between the local chromatic number and its directed version
Gábor Simonyi, Gábor Tardos, Ambrus Zsbán
The local chromatic number is a coloring parameter defined as the minimum number of colors that should appear in the most colorful closed neighborhood of a vertex under any proper…
Invariant Gaussian processes and independent sets on regular graphs of large girth
Endre Csóka, Balázs Gerencsér, Viktor Harangi +1
We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact,…
Squares and difference sets in finite fields
Christine Bachoc, Imre Z. Ruzsa, Mate Matolcsi
For infinitely many primes we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set contains only q…
Complements of nearly perfect graphs
András Gyárfás, Zhentao Li, Raphael Machado +3
A class of graphs closed under taking induced subgraphs is -bounded if there exists a function such that for all graphs in the class, . We consider th…
Coverings by few monochromatic pieces - a transition between two Ramsey problems
András Gyárfás, Gábor N. Sárközy, Stanley Selkow
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs…
Phase transitions in the Ramsey-Turán theory
József Balogh, Ping Hu, Miklós Simonovits
Let be a function and be a graph. Denote by the maximum number of edges of an -free graph on vertices with independence number less than . Er…
2013 Unit Vectors in the Plane
Imre Barany, Boris D. Ginzburg, Victor S. Grinberg
Given a norm on the plane and 2013 unit vectors in this norm, there is a signed sum of these vectors whose norm is at most one.
Minimal symmetric differences of lines in projective planes
Paul Balister, Béla Bollobás, Zoltán Füredi +1
Let q be an odd prime power and let f(r) be the minimum size of the symmetric difference of r lines in the Desarguesian projective plane PG(2,q). We prove some results about the fu…