An extremal problem onKr-free graphs

DOI10.1002/JGT.3190120407MaRDI QIDQ3826591zbMATH OpenOpenAlexFDO

Authors Peter Frankl, János Pach

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120407

zbMATH Keywords

K(r)-free graphsmaximal number of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Extremal problems concerning Kneser-graphs
• scientific article; zbMATH DE number 3407723
• On some extremal problems on r-graphs
• scientific article; zbMATH DE number 4033781
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On a problem in extremal graph theory
• scientific article; zbMATH DE number 4189765
• On some extremal problems in graph theory
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t}\)
• scientific article; zbMATH DE number 3222643

Cited in

(4)

• Erratum: An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\) [Discrete Mathematics 187 (1998) 195-209]
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)
• scientific article; zbMATH DE number 1071407 (Why is no real title available?)
• On the Structure of Edge Graphs

This page was built for publication: An extremal problem onKr-free graphs

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