Foster, Turán, and neighbors

DOI10.1080/00029890.2021.1839280MaRDI QIDQ5144502zbMATH OpenOpenAlexFDO

Authors Xiaomin Chen, Fenglin Huang, Shuhan Zhou, Ming-Xuan Zou, Junchi Zuo

Publication date 18 January 2021

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2021.1839280

zbMATH Keywords

graph inequalityTurán's theorem

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Extremal problems in graph theory (05C35)

Recommendations

• Another extremal property of some Turán graphs
• A new proof of Foster's first theorem
• A generalization of a Turán's theorem about maximum clique on graphs
• scientific article; zbMATH DE number 3819765
• Turán's graph theorem, measures and probability theory

Cites work

• A new proof of Foster's first theorem
• Graph theory
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(1)

• A new proof of Foster's first theorem

This page was built for publication: Foster, Turán, and neighbors

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