On the sum necessary to ensure that a degree sequence is potentially H-graphic

Given a graph H , a graphic sequence π is potentially H-graphic if there is some realization of π that contains H as a subgraph. In 1991, Erdős, Jacobson and Lehel posed the following question: Determine the minimum even integer σ( H,n ) such that every n -term graphic sequence with sum at least σ(...

Full description

Bibliographic Details

Published in:	Combinatorica (Budapest. 1981) Vol. 36; no. 6; pp. 687 - 702
Main Authors:	Ferrara, Michael J., Lesaulnier, Timothy D., Moffatt, Casey K., Wenger, Paul S.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01-12-2016 Springer Nature B.V
Subjects:	Combinatorics Mathematics Mathematics and Statistics Original Paper 05C07 05C35
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!