2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Michael Savery
For large n we determine exactly the maximum numbers of induced C4 and C5 subgraphs that a planar graph on n vertices can contain. We show that K2,n−2 uniquely achie…