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

DOI10.1016/J.DISC.2011.05.001zbMATH Open1239.05019DBLPjournals/dm/BarrusHJW12OpenAlexW1995713817WikidataQ60326854 ScholiaQ60326854MaRDI QIDQ411650FDOQ411650

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

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

zbMATH Keywords

dominance ordergraphic sequenceinteger partitionaignergallai inequalitiesgraphic listtriesch methodErdős

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• Graphic sequences with unique realization
• Contributions to the theory of graphic sequences
• Threshold Sequences
• Title not available (Why is that?)

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)