Contents

-

On the Tree Domination Number of a Random Graph

Lane Clark 1, Darin Johnson2
1DEPARTMENT OF MATHEMATICS, SOUTHERN ILLINOIS UNIVERSITY CAR- BONDALE, CARBONDALE, IL 62901-4408
2DEPARTMENT OF MATHEMATICAL SCIENCES, DELAWARE STATE UNI- VERSITY, Dover, DE 19901

Abstract

We prove a two-point concentration for the tree domination number of the random graph Gn,p provided p is constant or p0 sufficiently slow.