Y by
For a positive integer
, find the smallest integer
such that any graph with
vertices and at least
edges must contain at least two disjoint cycles (cycles with no common vertices).




This post has been edited 1 time. Last edited by steven_zhang123, Today at 11:07 AM