1 citations · 1 across the 5 of their papers we have counts for
1 paper · 2 filters
Jessica De Silva, Kristin Heysse, Adam Kapilow +2
For two graphs G and H, the Turán number ex(G,H) is the maximum number of edges in a subgraph of G that contains no copy of H. Chen, Li, and Tu determined the Turán numbe…