scientific article; zbMATH DE number 1071407

MaRDI QIDQ4357282zbMATH OpenFDO

Authors Liang Sun, Gang Yang

Publication date 8 March 1998

zbMATH Keywords

extremal graphsmaximum number of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the number of edges in maximally linkless graphs
• Edge maximal C_{2k+1}-edge disjoint free graphs
• Maximum number of edges in a critically k-connected graph
• The number of \(K_{s,t}\)-free graphs
• Edge-maximal \(C_{2k+1}\)-vertex disjoint free graphs
• An extremal problem onKr-free graphs
• Edge-maximal \(\theta_{2k+1}\)-edge disjoint free graphs
• Edge‐maximal (k, i)‐graphs

Cited in

(3)

• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• Edge maximal C_{2k+1}-edge disjoint free graphs
• scientific article; zbMATH DE number 2124072 (Why is no real title available?)

This page was built for publication:

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