On a valence problem in extremal graph theory

1973/08/01 by P. Erdös, Miklós Simonovits, M. Simonovits · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Discrete mathematics #Friendship graph #Graph #Graph power #Graph theory and applications #Limits and Structures in Graph Theory #Line graph #Mathematics #Wheel graph #Windmill graph

paper · doi:10.1016/0012-365x(73)90126-x

crossref issued 1973/08/01 · crossref published 1973/08/01 · crossref published-print 1973/08/01 · openalex publication_date 1973/08/01 · crossref created 2002/07/25 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/08/06 · openalex updated_date 2026/08/06

Citations

• On the connection between chromatic number, maximal clique and minimal degree of a graph

Cited by

• Triangle-free four-chromatic graphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the Structure of Dense Triangle-Free Graphs
• Grötzsch graph [wikipedia]
• Triangle-free graph [wikipedia]