Csilla Bujtás

Learn More
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph G and take it into a set D. The number of vertices dominated by the set D must increase in each single turn and the game ends when D becomes a dominating set of G. Dominator aims to minimize whilst Staller aims to maximize the number of turns (or equivalently,(More)
In the domination game, introduced by Brešar, Klavžar, and Rall in 2010, Dom-inator and Staller alternately select a vertex of a graph G. A move is legal if the selected vertex v dominates at least one new vertex – that is, if we have a u ∈ N [v] for which no vertex from N [u] was chosen up to this point of the game. The game ends when no more legal moves(More)
A color-bounded hypergraph is a hypergraph (set system) with ver-tex set X and edge set E = {E coloring ϕ is proper if for every i, the number of colors occurring in edge E i satisfies s i ≤ |ϕ(E i)| ≤ t i. The hypergraph H is colorable if it admits at least one proper coloring. We consider hypergraphs H over a " host graph " , that means a graph G on the(More)