Andr'as Imolay

activity

20192025

most citedIdentification of a monotone Boolean function with

k

"reasons" as a combinatorial search problem

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

collaborators

Showing 2025Show all

2 papers · 1 filter

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…