13 citations · 20 across the 13 of their papers we have counts for
16 papers · 1 filter
Small Boolean Sections in Alon-Füredi Covers
Zoltán Lóránt Nagy
Alon and Füredi proved that at least affine hyperplanes are required to cover while avoiding the origin, and that this bound is sharp. We stu…
Balanced intersection size distributions in finite geometries and vector spaces
Zoltán Lóránt Nagy, Zsuzsa Weiner
We study intersection size distributions arising in finite geometries and vector spaces. For a projective plane of order with line set , we show that \[ \min_…
Steiner triple systems and spreading sets in projective spaces
Zoltán Lóránt Nagy, Levente Szemerédi
We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as…
On the balanced upper chromatic number of finite projective planes
Zoltán L. Blázsik, Aart Blokhuis, Štefko Miklavič +2
In this paper, we study vertex colorings of hypergraphs in which all color class sizes differ by at most one (balanced colorings) and each hyperedge contains at least two vertices…
Coupon-Coloring and total domination in Hamiltonian planar triangulations
Zoltán Lóránt Nagy
We consider the so-called coupon-coloring of the vertices of a graph where every color appears in every open neighborhood, and our aim is to determine the maximal number of colors…
Transversals in generalized Latin squares
János Barát, Zoltán Lóránt Nagy
We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order is equivalent to a proper edge-coloring of $K…
Saturating sets in projective planes and hypergraph covers
Zoltán Lóránt Nagy
Let be an arbitrary finite projective plane of order . A subset of its points is called saturating if any point outside is collinear with a pair of points from …
Partition dimension of projective planes
Zoltán Blázsik, Zoltán Lóránt Nagy
We determine the partition dimension of the incidence graph of the projective plane up to a constant factor as $(2+o(1))\log_2{q}\leq \mathrm{pd}(G(Π_q))\leq (4+…
On the number of k-dominating independent sets
Zoltán Lóránt Nagy
We study the existence and the number of -dominating independent sets in certain graph families. While the case namely the case of maximal independent sets - which is orig…
The number of unit-area triangles in the plane: Theme and variations
Orit E. Raz, Micha Sharir
We show that the number of unit-area triangles determined by a set of points in the plane is , improving the earlier bound of Apfelbaum and Sharir…
The Density Turán problem
Péter Csikvári, Zoltán Lóránt Nagy
Let be a graph on vertices and let the blow-up graph be defined as follows. We replace each vertex of by a cluster and connect some pairs of vertices…
Identifying codes and searching with balls in graphs
Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3
Given a graph and a positive integer we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…
Density version of the Ramsey problem and the directed Ramsey problem
Zoltán Lóránt Nagy
We discuss a variant of the Ramsey and the directed Ramsey problem. First, consider a complete graph on vertices and a two-coloring of the edges such that every edge is colored…
Avoider-Enforcer star games
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy +3
In this paper, we study Avoider-Enforcer games played on the edge set of the complete graph on vertices. For every constant we analyse the -star game, wh…
Permutations over cyclic groups
Zoltán Lóránt Nagy
Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements of the cyclic group of…
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})}{δ(\…