6 citations · 16 across the 19 of their papers we have counts for
7 papers · 1 filter
On colorings of the Boolean lattice avoiding a rainbow copy of a poset
Balázs Patkós
Let () denote the maximum possible size of the smallest color class in a (partial) -coloring of the Boolean lattice that does not admit a rainbow antichai…
Finding non-minority balls with majority and plurality queries
Huilan Chang, Dániel Gerbner, Balázs Patkós
Given a set of colored balls, a \textit{majority, non-minority or plurality ball} is one whose color class has size more than , at least or larger than any other col…
On the maximum number of copies of H in graphs with given size and order
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +1
We study the maximum number of copies of a graph in graphs with given number of vertices and edges. We show that for any fixed graph , is asymptotica…
Rainbow Ramsey problems for the Boolean lattice
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4
We address the following rainbow Ramsey problem: For posets what is the smallest number such that any coloring of the elements of the Boolean lattice either admits…
Vertex Turán problems for the oriented hypercube
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2
In this short note we consider the oriented vertex Turán problem in the hypercube: for a fixed oriented graph , determine the maximum size $ex_v(\overrightarrow…
On the number of containments in -free families
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2
A subfamily is a copy of the poset if there exists a bijection such that i…