Andr'as Imolay

activity

20192025

collaborators

Showing math.COShow all

3 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…

math.CO2024

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.CO2019

Covers, orientations and factors

Péter Csikvári, András Imolay

Given a graph $G$ with only even degrees let $ε (G)$ denote the number of Eulerian orientations, and let $h (G)$ denote the number of half graphs, that is, subgraphs $F$ su…

Clique number of xor-powers of Kneser graphs

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

Covers, orientations and factors

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