Room 217

Feasible degree sequences for graphs with bounded real weights

Digjoy Paul

IMSc

We answer the following question:

Given a sequence (d(1),...,d(n)) of real numbers, when does there exist a simple graph on vertices 1,...n, and edge weights between 0 and 1 such the sum of the weights of edges incident upon the ith vertex is d(i) for each i?

This is a continuous analog of the feasibility question for the degree sequences of simple graphs.