The extremal function for three disjoint theta graphs.

MaRDI QIDQ3134373zbMATH OpenFDO

Authors Lingxiu Wu, Yunshu Gao

Publication date 9 February 2018

zbMATH Keywords

disjoint theta graphsextremal functionminimum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
• The extremal function for two disjoint cycles
• Independence number and disjoint theta graphs
• Sharp minimum degree conditions for the existence of disjoint theta graphs
• Turán numbers of theta graphs

Cited in

(10)

• Graphs constructible from cycles and complete graphs
• scientific article; zbMATH DE number 2028650 (Why is no real title available?)
• Turán numbers of theta graphs
• SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
• Independence number and disjoint theta graphs
• On the Turán Number of Generalized Theta Graphs
• Excluding a large theta graph
• The extremal function for two disjoint cycles
• Sharp minimum degree conditions for the existence of disjoint theta graphs
• The extremal function for 3-linked graphs

This page was built for publication: The extremal function for three disjoint theta graphs.

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