Solution to a Forcible Version of a Graphic Sequence Problem

TL;DR

This paper characterizes conditions under which any integer sequence within specified bounds and with an even sum is graphic, extending the Erdős–Gallai theorem and addressing a problem posed by Niessen.

Contribution

It provides a comprehensive characterization for when all bounded sequences with even sum are graphic, generalizing the Erdős–Gallai theorem and solving a problem by Niessen.

Findings

Provides a characterization for bounded sequences to be graphic

Generalizes the Erdős–Gallai theorem

Addresses Niessen's problem

Abstract

Let $A_n=(a_1,a_2,\ldots,a_n)$ and $B_n=(b_1,b_2,\ldots,b_n)$ be nonnegative integer sequences with $A_n\le B_n$. The purpose of this note is to give a good characterization such that every integer sequence $\pi=(d_1,d_2,\ldots d_n)$ with even sum and $A_n\le \pi\le B_n$ is graphic. This solves a forcible version of problem posed by Niessen and generalizes the Erd\H{o}s--Gallai theorem.