On fractional realizations of graph degree sequences

We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and characterize degree sequences for which each polytope vertex corresponds to a simple graph realization. These include the degree sequences of pseudo-split graphs, and we characterize their realizations both in terms of forbidden subgraphs and graph structure.Comment: 18 pages, 4 figure

Recognition of split-graphic sequences

Using different definitions of split graphs we propose quick algorithms for the recognition and extremal reconstruction of split sequences among integer, regular, and graphic sequences

Graphical sequences of some family of induced subgraphs

The subdivision graph $S(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into every edge of $G$. The $S_{vertex}$ or $S_{ver}$ join of the graph $G_{1}$ with the graph $G_{2}$, denoted by $G_{1}\dot{\vee}G_{2}$, is obtained from $S(G_{1})$ and $G_{2}$ by joining all vertices of $G_{1}$ with all vertices of $G_{2}$. The $S_{edge}$ or $S_{ed}$ join of $G_{1}$ and $G_{2}$, denoted by $G_{1}\bar{\vee}G_{2}$, is obtained from $S(G_{1})$ and $G_{2}$ by joining all vertices of $S(G_{1})$ corresponding to the edges of $G_{1}$ with all vertices of $G_{2}$. In this paper, we obtain graphical sequences of the family of induced subgraphs of $S_{J} = G_{1}\vee G_{2}$, $S_{ver} = G_{1}\dot{\vee}G_{2}$ and $S_{ed} = G_{1}\bar{\vee}G_{2}$. Also we prove that the graphic sequence of $S_{ed}$ is potentially $K_{4}-e$-graphical

The principal Erdős–Gallai differences of a degree sequence

The Erdős–Gallai criteria for recognizing degree sequences of simple graphs involve a system of inequalities. Given a fixed degree sequence, we consider the list of differences of the two sides of these inequalities. These differences have appeared in varying contexts, including characterizations of the split and threshold graphs, and we survey their uses here. Then, enlarging upon properties of these graph families, we show that both the last term and the maximum term of the principal Erdős–Gallai differences of a degree sequence are preserved under graph complementation and are monotonic under the majorization order and Rao\u27s order on degree sequences

Beta-expansions, natural extensions and multiple tilings associated with Pisot units

From the works of Rauzy and Thurston, we know how to construct (multiple) tilings of some Euclidean space using the conjugates of a Pisot unit $\beta$ and the greedy $\beta$-transformation. In this paper, we consider different transformations generating expansions in base $\beta$, including cases where the associated subshift is not sofic. Under certain mild conditions, we show that they give multiple tilings. We also give a necessary and sufficient condition for the tiling property, generalizing the weak finiteness property (W) for greedy $\beta$-expansions. Remarkably, the symmetric $\beta$-transformation does not satisfy this condition when $\beta$ is the smallest Pisot number or the Tribonacci number. This means that the Pisot conjecture on tilings cannot be extended to the symmetric $\beta$-transformation. Closely related to these (multiple) tilings are natural extensions of the transformations, which have many nice properties: they are invariant under the Lebesgue measure; under certain conditions, they provide Markov partitions of the torus; they characterize the numbers with purely periodic expansion, and they allow determining any digit in an expansion without knowing the other digits