Number of edges versus minimal vertex cover
Let SSS be the set of finite simple graphs without any induced 2K_2. Find
where e(G)e(G)e(G) is the number of edges, and d(G)d(G)d(G) is the smallest size of a vertex cover.
Be the first to start the discussion!