22 citations · 46 across the 9 of their papers we have counts for
13 papers
Multicolor Turán numbers
András Imolay, János Karl, Zoltán Lóránt Nagy +1
We consider a natural generalisation of Turán's forbidden subgraph problem and the Ruzsa-Szemerédi problem by studying the maximum number of edge-disjoint copies of a f…
A note on internal partitions: the -regular case and beyond
Pál Bärnkopf, Zoltán Lóránt Nagy, Zoltán Paulovics
An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the…
Short minimal codes and covering codes via strong blocking sets in projective spaces
Tamás Héger, Zoltán Lóránt Nagy
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets…
Generalized Outerplanar Turán numbers and maximum number of k-vertex subtrees
Dávid Matolcsi, Zoltán Lóránt Nagy
We prove an asymptotic result on the maximum number of k-vertex subtrees in binary trees of given order. This problem turns out to be equivalent to determine the maximum number of…
Unified approach to the generalized Turán problem and supersaturation
Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer
In this paper we introduce a unifying approach to the generalized Turán problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m,…
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz
Oliver Janzer, Zoltán Lóránt Nagy
The long-standing Erdős-Faber-Lovász conjecture states that every -uniform linear hypergaph with edges has a proper vertex-coloring using colors. In this paper we propos…
On the Turán number of the blow-up of the hexagon
Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy
The -blowup of a graph , denoted by , is the graph obtained by replacing the vertices and edges of with independent sets of size and copies of , respec…
Spreading linear triple systems and expander triple systems
Zoltán L. Blázsik, Zoltán Lóránt Nagy
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we d…
The Turán number of blow-ups of trees
Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy
A conjecture of Erdős from 1967 asserts that any graph on vertices which does not contain a fixed -degenerate bipartite graph has at most edges, where i…
Triangle areas in line arrangements
Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy +1
A widely investigated subject in combinatorial geometry, originated from Erdős, is the following. Given a point set of cardinality in the plane, how can we describe the dis…
Supersaturation of : from Zarankiewicz towards Erdős-Simonovits-Sidorenko
Zoltán Lóránt Nagy
For a positive integer , a graph and a bipartite graph let denote the number of copies of in , and let denote the minim…
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…
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…