Adaptive majority problems for restricted query graphs and for weighted sets

Damásdi, Gábor and Gerbner, Dániel and Katona, Gyula and Methuku, Abhishek and Keszegh, Balázs and Lenger, Dániel and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2019) Adaptive majority problems for restricted query graphs and for weighted sets. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 601-609. ISSN 0862-9544

Preview

Text 1272-1-6690-2-10-20190816.pdf Download (272kB) | Preview

Abstract

Suppose that the vertices of a graph $G$ are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the \emph{majority color} (if it exists), and any vertex of this color is called a \emph{majority vertex}. We study the problem of finding a majority vertex (or show that none exists), if we can query edges to learn whether their endpoints have the same or different colors. Denote the least number of queries needed in the worst case by $m(G)$. It was shown by Saks and Werman that $m(Kn)\!=\! n-b(n)$ where $b(n)$ is the number of 1's in the binary representation of $n$. In this paper we initiate the study of the problem for general graphs. The obvious bounds for a connected graph $G$ on $n$ vertices are $n-b(n)łe m(G)łe n-1$. We show that for any tree $T$ on an even number of vertices we have $m(T)=n-1$, and that for any tree $T$ on an odd number of vertices, we have $n-65łe m(T)łe n-2$. Our proof uses results about the weighted version of the problem for $Kn$, which may be of independent interest. We also exhibit a sequence $Gn$ of graphs with $m(Gn)=n-b(n)$ such that the number of edges in $Gn$ is $O(nb(n))$.

Actions (login required)

Edit Item