66 citations · 66 across the 3 of their papers we have counts for
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…
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…
On the minimum leaf number of cubic graphs
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput +1
The \emph{minimum leaf number} of a connected graph is defined as the minimum number of leaves of the spanning trees of . We present new results concerning t…
Computing Majority with Triple Queries
Gianluca De Marco, Evangelos Kranakis, Gabor Wiener
Consider a bin containing balls colored with two colors. In a -query, balls are selected by a questioner and the oracle's reply is related (depending on the computation…
The ultimate question
Gábor Wiener, Makoto Araya
We present a planar hypohamiltonian graph on 42 vertices and show some consequences.