13 citations · 20 across the 13 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
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…
math.CO2014
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…
math.CO2014
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…