Zoltán Lóránt Nagy

activity

20142024

PG (n, q)

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

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…