László Székely: The Partition Adjacency Matrix realization problem

The problem that we discuss is the following: Can we realize a given degree sequence, such that we also satisfy two further restrictions simultaneously:

(i) some pairs are forbidden to use as an edge, and

(ii) the vertex set is partitioned into classes, and the number of edges in the realization should give prescribed number of edges between (and within) partition clases. This problem is relevant for network science. The talk focuses on the bipartite version of this problem. 

Joint work with Éva Czabarka, Zoltán Toroczkai, Shanise Walker