56 citations · 62 across the 23 of their papers we have counts for
3 papers · 2 filters
The Turán number of the square of a path
Chuanqi Xiao, Gyula O. H. Katona, Jimeng Xiao +1
The Turán number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let P_k be the path with k vertices, the square…
The domination number of the graph defined by two levels of the -cube, II
József Balogh, Gyula O. H. Katona, William Linz +1
Consider all -element subsets and -element subsets of an -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell…
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…