1 problem

Linear edge bound conjecture. A graph $G$ on $n$ vertices belonging to the class $R_2$ can have at most $O(n)$ edges.