Suppose we have a graph $ G$ with $ n$ vertices. If we color the edges of $ G$ by two colors, then we can conclude by Konig’s Theorem that there exists a monochromatic subtree $ T$ with at least $ n/{\alpha}$ vertices, $ \alpha$ is the size of maximum independent set in the graph.Read 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
