Discrete Math Seminar

The Erdős-Sós conjecture states that the maximum number of edges in an $n$-vertex graph without a given $k$-vertex tree is at most $\frac{n(k-2)}{2}$. Despite significant interest, the conjecture remains …