The Erdős-Sós conjecture states that the maximum number of edges in an
Despite significant interest, the conjecture remains unsolved. Recently, Caro, Patkós, and Tuza considered this problem for host graphs that are connected.
Settling a problem posed by them, for a
Furthermore, we show that this is optimal: there is a family of
connected
Joint work with Suyun Jiang and Hong Liu.