Abstract
For two graphs G and F, the extremal number of F in G, denoted by ex(G,F), is the maximum number of edges in a spanning subgraph of G not containing F as a subgraph. Determining ex(Kn,F) for a given graph F is a classical extremal problem in graph theory. In 1962, Erdős determined ex(Kn,kK3), which generalized Mantel's Theorem. On the other hand, in 1974, Bollobás, Erdős, and Straus determined ex(Kn1,n2,…,nr,Kt), which extended Turán's Theorem to complete multipartite graphs. In this paper, we determine ex(Kn1,n2,…,nr,kK3) for r≥4 and 10k−4≤n1+4k≤n2≤n3≤⋯≤nr.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
