Related papers: Enumeration of regular multipartite hypergraphs
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphs in which some labels and edges are not…
We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O(sqrt{n}) edges. This bound is asymptotically…
We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…
In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…
A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensively studied in the literature, and in this paper we consider…
We provide a clarification of the classification of two-dimensional algebras over an arbitrary base field. Using this clarification, we determine the number of non-isomorphic two-dimensional algebras over a finite field.
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
Let $\mathbf{T}_{\mathbf{a},\mathbf{b}}$ be the number of $3$-way contingency tables of size $m \times n \times p$ with two of its three plane-sum margins fixed by $\mathbf{a}=(a_1, \ldots, a_m) \in \mathbb{N}^m$ and $\mathbf{b}=(b_1,…
We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in a Euclidean space. Moreover, the primary…
We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…
A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, J{\o}rgensen et al. \cite{JG14} initiated the study of doubly regular team…
By means of a binary visibility graph, we present a novel method to study random binary sequences. The behavior of the some topological properties of the binary visibility graph, such as the degree distribution, the clustering coefficient,…
The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.