17 citations · 30 across the 22 of their papers we have counts for
31 papers
Identification of a monotone Boolean function with "reasons" as a combinatorial search problem
Dániel Gerbner, András Imolay, Gyula O. H. Katona +5
We study the number of queries needed to identify a monotone Boolean function . A query consists of a 0-1-sequence, and the answer is the value of…
An Erdős-Ko-Rado type theorem for subgraphs of perfect matchings
Dániel T. Nagy
Let be a -vertex graph with pairwise disjoint edges and let be the family of subsets of that span exactly edges and isolated…
Query complexity of Boolean functions on the middle slice of the cube
Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy +4
We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query all but 7 input bits to co…
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5
We study , the largest number of edges in an -vertex graph that contains exactly copies of a given subgraph . The case is the Turán number…
The extensible No-Three-In-Line problem
Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe
The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an grid while avoiding a collinear triple. The maximum is well known…
Triangles in intersecting families
Dániel T. Nagy, Balázs Patkós
We prove the following the generalized Turán type result. A collection of sets is an -triangle if for every we have $\ca…