Domination number of cubic graphs with large girth

Daniel Kral, Petr Skoda, Jan Volec

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n/g)<3n/10+O(n/g).