English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A simple graph G is a 2-tree if G = K3, or G has a vertex v of degree 2, whose neighbors are adjacent, and G — v is a 2-tree. Clearly, if G is a 2-tree on n vertices, then E(G) = 2n — 3. A non-increasing sequence π = (d1,...,dn) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices. [Acta Math. Sin. Engl. Ser., 25, 795–802 (2009)] proved that if k ≥ 2, n ≥ $$\frac{9}{2}{k^2} + \frac{{19}}{2}k$$ and π = (d1,...,dn) is a graphic sequence with $$\sum\nolimits_{i = 1}^n {{d_i}} > (k - 2)n$$, then p has a realization containing every 1-tree (the usual tree) on k vertices. Moreover, the lower bound (k — 2)n is the best possible. This is a variation of a conjecture due to Erdos and Sós. In this paper, we investigate an analogue problem for 2-trees and prove that if k ≥ 3 is an integer with k = i (mod3), $$k \equiv i(\bmod 3)n \ge 20{[\frac{k}{3}]^2} + 31[\frac{k}{3}] + 12$$ π = (d1,...,dn is a graphic sequence with $$\sum\nolimits_{i = 1}^n {{d_i}} > \max \{ (k - 1)(n - 1),2[\frac{k}{3}]n - 2n - {[\frac{k}{3}]^2} + [\frac{{2k}}{3}] + 1 - 1{( - 1)^i}\} $$, then π has a realization containing every 2-tree on k vertices. Moreover, the lower bound max $$\{ k - 1)(n - 1),2[\frac{k}{3}]n - 2n - {[\frac{{2k}}{3}]^2} + [\frac{{2k}}{3}] + 1 - 1{( - 1)^i}\} $$ is the best possible. This result implies a conjecture due to [Discrete Math. Theor. Comput. Sci., 17(3), 315–326 (2016)].

Exact Solution to an Extremal Problem on Graphic Sequences with a Realization Containing Every 2-Tree on k Vertices