Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices

DOI10.1007/s10114-020-8300-1zbMath1437.05051arXiv1807.00470OpenAlexW3016210604MaRDI QIDQ1987561

Dong Yang Zhai, De Yan Zeng, Jian Hua Yin

Publication date: 15 April 2020

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.00470

zbMATH Keywords

degree sequencerealizationgraphic sequence2-tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (1)

Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• A variation of a conjecture due to Erdös and Sós
• On the potentially \(P_k\)-graphic sequences
• On spanning 2-trees in a graph
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Potentially K m — G-graphical sequences: A survey
• A Characterization of the degree sequences of 2-trees

This page was built for publication: Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices