Zoltán Lóránt Nagy

activity

20142024

collaborators

5 papers

math.CO2024

Partitioning the projective plane to two incidence-rich parts

Zoltán Lóránt Nagy

An internal or friendly partition of a vertex set $V (G)$ of a graph $G$ is a partition to two nonempty sets $A \cup B$ such that every vertex has at least as many neighbours in its…

math.CO2016

Partition dimension of projective planes

Zoltán Blázsik, Zoltán Lóránt Nagy

We determine the partition dimension of the incidence graph $G (Π_{q})$ of the projective plane $Π_{q}$ up to a constant factor $2$ as $(2+o(1))\log_2{q}\leq \mathrm{pd}(G(Π_q))\leq (4+…

math.CO2015

On the number of maximal intersecting k-uniform families and further applications of Tuza's set pair method

Zoltán Lóránt Nagy, Balázs Patkós

We study the function $M (n, k)$ which denotes the number of maximal $k$ -uniform intersecting families $F \subseteq (k [ n ])$ . Improving a bound of Balogh at al. on $M (n, k)$ , we…

math.CO2014

The Density Turán problem

Péter Csikvári, Zoltán Lóránt Nagy

Let $H$ be a graph on $n$ vertices and let the blow-up graph $G [H]$ be defined as follows. We replace each vertex $v_{i}$ of $H$ by a cluster $A_{i}$ and connect some pairs of vertices…

math.CO2014

Identifying codes and searching with balls in graphs

Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3

Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…