29 citations · 72 across the 26 of their papers we have counts for
4 papers · 1 filter
On the number of cycles in a graph with restricted cycle lengths
Dániel Gerbner, Balázs Keszegh, Cory Palmer +1
Let be a set of positive integers. We call a (directed) graph an \emph{-cycle graph} if all cycle lengths in belong to . Let be the maximum number of cyc…
Line Percolation in Finite Projective Planes
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros +2
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolatin…
Dominating sequences in grid-like and toroidal graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
A longest sequence of distinct vertices of a graph such that each vertex of dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…
The minimum number of vertices in uniform hypergraphs with given domination number
Csilla Bujtás, Balázs Patkós, Zsolt Tuza +1
The \textit{domination number} of a hypergraph is the minimum size of a subset of the vertice…