Consider a complete graph of 2020 vertices. What is the least number of edges that need to be marked such that each triangle (3-vertex subgraph) has an odd number of marked edges?
Consider a complete graph of 2020 vertices. What is the least number of edges that need to be marked such that each triangle (3-vertex subgraph) has an odd number of marked edges?