Find a quasi-random subgraph of linear size in a given graph.

26 Views Asked by At

This is a problem posed in a Problem set given by Yufei Zhao's course 18.S997. Show that every graph contains a quasi-random subgraph of linear size. It seems that edge density increment or decrement argument doesn't work, e.g., balanced complete bipartite graph and two disjoint cliques of equal size.