It is known that in any tournament with $ n$ vertices, there is a dominating set of size no more than $ \lceil \log_2 n\rceil$ . (See Fact 2.5 here.) What about when the tournament is chosen probabilistically? E.g. each edge is chosen independently and randomly. What are some known results about the size ofRead more
Blog
Satisfaction guarantee
Best Proxy Packs
-
2,000 Private Proxies
$299.00 / month
-
1,000 Private Proxies
$179.00 / month
Like And Follow Us
