Andr'as Imolay

collaborators

3 papers

math.CO2025

Clique number of xor-powers of Kneser graphs

ZoltÃ¡n FÃ¼redi, AndrÃ¡s Imolay, ÃdÃ¡m Schweitzer

Let $f_{ℓ} (n, k)$ denote the clique number of the xor-product of $ℓ$ isomorphic Kneser graphs KG(n,k). Alon and Lubetzky investigated the case of complete graphs as a coding th…

cs.DS2025

Finding the diameter of a tree with distance queries

DÃ¡niel Gerbner, AndrÃ¡s Imolay, Kartal Nagy +2

We study the number of distance queries needed to identify certain properties of a hidden tree $T$ on $n$ vertices. A distance query consists of two vertices $x, y$ , and the answer…

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…

Clique number of xor-powers of Kneser graphs

Finding the diameter of a tree with distance queries

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

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