Turán numbers of vertex-disjoint cliques in r-partite graphs
Jessica De Silva, Kristin Heysse, Adam Kapilow, Anna Schenfisch, Michael Young
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 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.
How is this information collected?
This collection of Montana State authored publications is collected by the Library to highlight the achievements of Montana State researchers and more fully understand the research output of the University. They use a number of resources to pull together as complete a list as possible and understand that there may be publications that are missed. If you note the omission of a current publication or want to know more about the collection and display of this information email Leila Sterman.