2 citations · 3 across the 7 of their papers we have counts for
13 papers
On Grundy total domination number in product graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
A longest sequence of vertices of a graph is a Grundy total dominating sequence of if for all , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…
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.…
On the maximum size of connected hypergraphs without a path of given length
Ervin Győri, Abhishek Methuku, Nika Salia +2
In this note we asymptotically determine the maximum number of hyperedges possible in an -uniform, connected -vertex hypergraph without a Berge path of length , as and…
Domination game on uniform hypergraphs
Csilla Bujtás, Balázs Patkós, Zsolt Tuza +1
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph by two players, namely Dominator and Staller, who alternately…
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…