Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903123 | Discrete Mathematics | 2018 | 5 Pages |
Abstract
For two graphs G and H, the Turán numberex(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 numbers ex(Km,n,kK2) for all kâ¥1 Chen et al. (2009). In this paper we will determine the Turán numbers ex(Ka1,â¦,ar,kKr) for all râ¥3 and kâ¥1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jessica De Silva, Kristin Heysse, Adam Kapilow, Anna Schenfisch, Michael Young,