An extremal problem concerning graphs not containing K_t and K_t,n-t

DOI10.1016/S0012-365X(97)00235-5MaRDI QIDQ1584294zbMATH OpenOpenAlexFDO

Authors Yoomi Rho

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00235-5

zbMATH Keywords

Turán's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t}\)
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t,t}\)
• An extremal problem onKr-free graphs
• Erratum: An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\) [Discrete Mathematics 187 (1998) 195-209]
• Extremal problems concerning Kneser-graphs
• scientific article; zbMATH DE number 147631
• scientific article; zbMATH DE number 4189765
• scientific article; zbMATH DE number 3407723
• On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
• scientific article; zbMATH DE number 4145688

Cited in

(3)

• 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,t}\)
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t,t}\)

This page was built for publication: An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)

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