A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum

zbMATH Open1401.05287arXiv1607.03836MaRDI QIDQ4560249FDOQ4560249

Authors: Brian D. Cloteaux 

Publication date: 10 December 2018

Abstract: We give a sufficient condition for a degree sequence to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.

Full work available at URL: https://arxiv.org/abs/1607.03836

Recommendations

• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• A sharp refinement of a result of Zverovich-Zverovich
• Degree sequences in graphs
• scientific article; zbMATH DE number 54810
• Constructive extensions of two results on graphic sequences

zbMATH Keywords

degree sequencegraphic sequencesgraphicnessErdős-Gallai theorem

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Graph theory (05C99)

Cited In (4)

• A sharp refinement of a result of Zverovich-Zverovich
• An improvement of a result of Zverovich-Zverovich
• Title not available (Why is that?)
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps

This page was built for publication: A sufficient condition for graphic sequences with given largest and smallest entries, length, and sum

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