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

DOI10.1016/j.disc.2011.05.001zbMath1239.05019OpenAlexW1995713817WikidataQ60326854 ScholiaQ60326854MaRDI QIDQ411650

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

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 orderinteger partitiongraphic sequenceErdősaignergallai inequalitiesgraphic listtriesch method

Mathematics Subject Classification ID

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

Related Items (8)

New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ A note on the characterization of digraphic sequences ⋮ New results on degree sequences of uniform hypergraphs ⋮ A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC ⋮ Unnamed Item ⋮ The principal Erdős-Gallai differences of a degree sequence ⋮ A sharp refinement of a result of Zverovich-Zverovich ⋮ Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays

Cites Work

• Contributions to the theory of graphic sequences
• Graphic sequences with unique realization
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Threshold Sequences
• Unnamed Item
• Unnamed Item

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