4 citations · 22 across the 32 of their papers we have counts for
4 papers · 2 filters
Forbidding rank-preserving copies of a poset
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2
The maximum size, , of a family of subsets of without containing a copy of as a subposet, has been intensively studied. Let be a graded poset.…
An improvement on the maximum number of -Dominating Independent Sets
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +2
Erdős and Moser raised the question of determining the maximum number of maximal cliques or equivalently, the maximum number of maximal independent sets in a graph on vertices.…
A plurality problem with three colors and query size three
Dániel Gerbner, Dániel Lenger, Máté Vizer
The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given balls, each of them colo…
Forbidden subposet problems for traces of set families
Dániel Gerbner, Balázs Patkós, Máté Vizer
In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets form a copy of a poset , if there…