Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps

DOI10.1016/J.DISC.2011.05.001MaRDI QIDQ411650zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael D. Barrus, Stephen G. Hartke, Kyle F. Jao, Douglas B. West

Publication date 30 April 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.1094

zbMATH Keywords

dominance ordergraphic sequenceinteger partitionaignergallai inequalitiesgraphic listtriesch methodErdős

Mathematics Subject Classification ID

Vertex degrees (05C07) Combinatorial aspects of partitions of integers (05A17)

Recommendations

• A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• Constructive extensions of two results on graphic sequences
• A note on a theorem of Erdős and Gallai
• A characterization of box-bounded degree sequences of graphs

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3489167 (Why is no real title available?)
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• Contributions to the theory of graphic sequences
• Graphic sequences with unique realization
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Threshold Sequences

Cited in

(10)

• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• A sufficient condition for a pair of sequences to be bipartite graphic
• The Erdős-Gallai theorem modulo \(k\)
• A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum
• A sharp refinement of a result of Zverovich-Zverovich
• The edge-count criterion for graphic lists
• The principal Erdős-Gallai differences of a degree sequence
• Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
• A note on the characterization of digraphic sequences

This page was built for publication: Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps

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