Related papers: Relations on Generalized Degree Sequences

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

T\^ete-\`a-t\^ete graphs and relative t\^ete-\`a-t\^ete graphs were introduced by N. A'Campo in 2010 to model monodromies of isolated plane curves. By recent workof Fdez de Bobadilla, Pe Pereira and the author, they provide a way of…

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…

We show that a general plane curve of degree at least 4 is uniquely determined by the full set of its bitangent lines. This problem has an elementary solution for degree at least 5, and the paper is almost entirely devoted to curves of…

We study and classify linearly normal surfaces in $\mathbf{P}^n$, of degree $d$ and sectional genus $g$, such that $d\geq 2g-1$.

A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This characterization yields a linear-time algorithm for…

The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…

In order theory, a rank function measures the vertical "level" of a poset element. It is an integer-valued function on a poset which increments with the covering relation, and is only available on a graded poset. Defining a vertical measure…

The classical Dehn--Sommerville relations assert that the $h$-vector of an Eulerian simplicial complex is symmetric. We establish three generalizations of the Dehn--Sommerville relations: one for the $h$-vectors of pure simplicial…

The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

The family of Buchsbaum simplicial posets generalizes the family of simplicial cell manifolds. The $h'$-vector of a simplicial complex or simplicial poset encodes the combinatorial and topological data of its face numbers and the reduced…

We revisit the problem of designing sublinear algorithms for estimating the average degree of an $n$-vertex graph. The standard access model for graphs allows for the following queries: sampling a uniform random vertex, the degree of a…

The geometry of graded principal bundles is discussed in the framework of graded manifold theory of Kostant-Berezin-Leites. In particular, we prove that a graded principal bundle is globally trivial if and only if it admits a global graded…

This paper presents an approach to the modeling of degree-degree correlation in complex networks. Thus, a simple function, \Delta(k', k), describing specific degree-to- degree correlations is considered. The function is well suited to…

This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…

We introduce the affine Vogan diagrams of complex simple Lie algebras. These are generalizations of Vogan diagrams, and we study the involutions represented by them. We apply these diagrams to study the symmetric pairs, in particular the…

The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…