A note on Turán's theorem
From MaRDI portal
Publication:2279574
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3365308 (Why is no real title available?)
- scientific article; zbMATH DE number 3185004 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Bounds on the number of complete subgraphs
- Extensions of Turán's theorem on graphs
- On the maximum number of cliques in a graph
- On the number of complete subgraphs and circuits contained in graphs
- Stable sets and polynomials
- Turan's Graph Theorem
Cited in
(12)- scientific article; zbMATH DE number 16113 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3819765 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 68603 (Why is no real title available?)
- 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)