Related papers: Enumeration of interval graphs and $d$-representab…

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…

We introduce a class of monotone $\sigma$-complete effect algebras, called representable, which are $\sigma$-homomorphic images of a class of monotone $\sigma$-complete effect algebras of functions taking values in the interval $[0,1]$ and…

Let $r_{k}(n)$ denote the number of representations of the integer $n$ as a sum of $k$ squares. In this paper, we give an asymptotic for $r_{k}(n)$ when $n$ grows linearly with $k$. As a special case, we find that \[ r_{n}(n) \sim \frac{B…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…

Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular,…

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…

An $n$-tuple $D=(d(1),\dots,d(n))$ is a \emph{feasible degree sequence} if there is a graph on $\{1,\dots,n\}$ such that $i$ has degree $d(i)$. Any such graph will have $m=\sum_{i=1}^n d(i)/2$ edges. Letting $G(D)$ be a graph chosen…

We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…

An $(n,d,\lambda)$-graph is a $d$ regular graph on $n$ vertices in which the absolute value of any nontrivial eigenvalue is at most $\lambda$. For any constant $d \geq 3$, $\epsilon>0$ and all sufficiently large $n$ we show that there is a…

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

How small can a set of vertices in the $n$-dimensional hypercube $Q_n$ be if it meets every copy of $Q_d$? The asymptotic density of such a set (for $d$ fixed and $n$ large) is denoted by $\gamma_d$. It is easy to see that $\gamma_d \leq…

We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…

We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity…

We prove large (and moderate) deviations for a class of linear combinations of spacings generated by i.i.d. exponentially distributed random variables. We allow a wide class of coefficients which can be expressed in terms of continuous…

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

In the persistent homology of filtrations, the indecomposable decompositions provide the persistence diagrams. However, in almost all cases of multidimensional persistence, the classification of all indecomposable modules is known to be a…

It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface S_g of genus g grows asymptotically like $c^{(g)}n^{5(g-1)/2-1}\gamma^n n!$ where $c^{(g)}>0$, and $\gamma \approx 27.23$ is the…