Potentially image-graphic sequences Original Research Article

A variation of a classical Turán-type extremal problem is considered as follows: determine the smallest even integer image such that every n-term graphic sequence image with term sum image has a realization G containing image as a subgraph. In this paper, we determine image for sufficiently large n, where image and image.