Abstract
Let 1 ≤p≤r+ 1, withr≥ 2 an integer, and letGbe a graph of ordern. Letd(v) denote the degree of a vertexv∈V(G). We show that ifthenGhas more than(r+ 1)-cliques sharing a common edge. From this we deduce that ifthenGcontains more thancliques of orderr+ 1.In turn, this statement is used to strengthen the Erdős–Stone theorem by using ∑v∈V(G)dp(v) instead of the number of edges.
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 callSimilar Papers
Disclaimer: 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.
