A sequence of nonnegative integers is $ k $-graphic if it is the degree sequence of a $ k $-
uniform hypergraph. The only known characterization of $ k $-graphic sequences is due to …

Directed links--representing asymmetric social ties or interactions (eg," follower-followee")--
arise naturally in many social networks and other complex networks, giving rise to directed …

An n‐tuple π (not necessarily monotone) is graphic if there is a simple graph G with vertex
set {v1,…, vn} in which the degree of vi is the ith entry of π. Graphic n‐tuples (d,…, d) and …

In hypergraph theory, determining a good characterization of d, the degree sequence of an h-
uniform hypergraph H, and deciding the complexity status of the reconstruction of H from d …

The main result of this paper is motivated by the following two apparently unrelated graph
optimization problems:(A) As an extension of Edmonds' disjoint branchings theorem …

We consider a problem of Discrete Tomography which consists of reconstructing a finite
lattice set S⊂ Z 2 from given horizontal and vertical X-rays (ie with prescribed numbers of …

We discuss sequential stub matching for directed graphs and show that this process can be
used to sample simple digraphs with asymptotically equal probability. The process starts …

We consider the problem of coloring a grid using p colors with the requirement that each row
and each column has a specific total number of entries of each color. Ryser (1957)[20], and …

Superresolution imaging aims at improving the resolution of an image by enhancing it with
other images or data that might have been acquired using different imaging techniques or …

A sequence π=(d_1,...,d_n) is graphic if there is a simple graph G with vertex set
{v_1,...,v_n\} such that the degree of v_i is d_i. We say that graphic sequences …