1 citations · 2 across the 2 of their papers we have counts for
5 papers
Clique number of xor-powers of Kneser graphs
Zoltán Füredi, András Imolay, Ádám Schweitzer
Let 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…
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 on vertices. A distance query consists of two vertices , and the answer…
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…
Connectedness of the Free Uniform Spanning Forest as a function of edge weights
Marcell Alexy, Márton Borbényi, András Imolay +1
Let be the Cartesian product of a regular tree and a finite connected transitive graph . It is shown in arXiv:2006.06387 that the Free Uniform Spanning Forest ($\mathsf{…
Covers, orientations and factors
Péter Csikvári, András Imolay
Given a graph with only even degrees let denote the number of Eulerian orientations, and let denote the number of half graphs, that is, subgraphs su…