5 papers
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5
We study , the largest number of edges in an -vertex graph that contains exactly copies of a given subgraph . The case is the Turán number…
On the Rényi-Ulam Game with Restricted Size Queries
Ádám Fraknói, Dávid Márton, Dániel Simon +1
We investigate the following version of the well-known Rényi-Ulam game. Two players - the Questioner and the Responder - play against each other. The Responder thinks of a number f…
Upper bounds for the necklace folding problems
Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1
A necklace can be considered as a cyclic list of red and blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona +8
Suppose that the vertices of a graph are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it…
A plurality problem with three colors and query size three
Dániel Gerbner, Dániel Lenger, Máté Vizer
The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given balls, each of them colo…