Dániel T. Nagy

collaborators

3 papers

math.CO2025

Identification of a monotone Boolean function with $k$ "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 $f : {0, 1}^{n} \to {0, 1}$ . A query consists of a 0-1-sequence, and the answer is the value of…

math.CO2024

An ErdÅs-Ko-Rado type theorem for subgraphs of perfect matchings

DÃ¡niel T. Nagy

Let $M_{k}$ be a $2 n$ -vertex graph with $n$ pairwise disjoint edges and let $H^{(p, s)} (n)$ be the family of subsets of $V (M_{n})$ that span exactly $p$ edges and $s$ isolated…

math.CO2024

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…

Identification of a monotone Boolean function with k "reasons" as a combinatorial search problem

An ErdÅs-Ko-Rado type theorem for subgraphs of perfect matchings

Query complexity of Boolean functions on the middle slice of the cube

Identification of a monotone Boolean function with $k$ "reasons" as a combinatorial search problem

An ErdÅs-Ko-Rado type theorem for subgraphs of perfect matchings