2 citations · 3 across the 4 of their papers we have counts for
8 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…
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…