29 citations · 72 across the 26 of their papers we have counts for
5 papers · 1 filter
Game saturation of intersecting families
Balazs Patkos, Mate Vizer
We consider the following combinatorial game: two players, Fast and Slow, claim -element subsets of alternately, one at each turn, such that both players are…
Nonrepetitive colorings of lexicographic product of graphs
Balázs Keszegh, Balázs Patkós, Xuding Zhu
A coloring of the vertices of a graph is nonrepetitive if there exists no path for which for all . Given graphs a…
Towards a de Bruijn-Erd\H os theorem in the -metric
Ida Kantor, Balazs Patkos
A well-known theorem of de Bruijn and Erdős states that any set of non-collinear points in the plane determines at least lines. Chen and Chvátal asked whether an analogous…
Families that remain -Sperner even after omitting an element of their ground set
Balazs Patkos
A family $\cF\subseteq 2^{[n]}$ of sets is said to be -trace -Sperner if for any -subset the family $\cF|_L=\{F|_L:F \in \cF\}=\{F \cap L: F \in \cF\}$ is…
Majority and Plurality Problems
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi +1
Given a set of n balls each colored with a color, a ball is said to be majority, k-majority, plurality if its color class has size larger than half of the number of balls, has size…