Y by
Let
be a positive integer. Find the smallest positive real
, satisfying the following condition: if
is a connected graph with
vertices and
edges, then it is always possible to delete at most
edges, so that the resulting graph has a proper vertex coloring with two colors.





