29 citations · 72 across the 26 of their papers we have counts for
5 papers · 1 filter
Some exact results for regular Turán problems
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
As a variant of the famous Turán problem, we study , the maximum number of edges that an -vertex regular graph can have without containing a copy of . We d…
On -close Sperner systems
Daniel Nagy, Balazs Patkos
For a set of positive integers, a set system is said to be -close Sperner, if for any pair of distinct sets in the skew d…
On general position sets in Cartesian products
Sandi Klavžar, Balázs Patkós, Gregor Rus +1
The general position number of a connected graph is the cardinality of a largest set of vertices such that no three distinct vertices from lie on a common…
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…
Distribution of colors in Gallai colorings
András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós +1
A Gallai coloring is an edge coloring that avoids triangles colored with three different colors. Given integers with …