A note on Turán's theorem

DOI10.1016/J.AMC.2019.05.020zbMATH Open1428.05159OpenAlexW2947160842MaRDI QIDQ2279574FDOQ2279574

Authors: 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

Recommendations

• Turán's theorem and k‐connected graphs
• Turan's Graph Theorem
• scientific article; zbMATH DE number 3819765
• On the structure of linear graphs
• Another extremal property of some Turán graphs

zbMATH Keywords

cliqueco-connected graphTurán's theorem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Stable sets and polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the maximum number of cliques in a graph
• Title not available (Why is that?)
• On the number of complete subgraphs and circuits contained in graphs
• Turan's Graph Theorem
• Bounds on the number of complete subgraphs
• Extensions of Turán's theorem on graphs

Cited In (12)

• Title not available (Why is that?)
• Note on a Turán-type problem on distances.
• Some remarks on Turán's inequality
• Retracted: A remark on the weak Turán's theorem
• Remark on a Note of P. Turan
• Applications of a graph theorem to solving some problems
• Title not available (Why is that?)
• Paul Turán's influence in combinatorics
• A note on maximum size of a graph without isolated vertices under the given matching number
• Note on Mantel theorem and Turán theorem
• Title not available (Why is that?)
• Turán's theorem and k‐connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279574)