A note on Turán's theorem

DOI10.1016/j.amc.2019.05.020zbMath1428.05159OpenAlexW2947160842MaRDI QIDQ2279574

Yanyan Li

Publication date: 13 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.05.020

zbMATH Keywords

cliqueTurán's theoremco-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A note on maximum size of a graph without isolated vertices under the given matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum number of cliques in a graph
• Bounds on the number of complete subgraphs
• Stable sets and polynomials
• Turan's Graph Theorem
• On the number of complete subgraphs and circuits contained in graphs
• Extensions of Turán's theorem on graphs

This page was built for publication: A note on Turán's theorem