Related papers: Polynomial representation for the expected length …

The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the research community after the work of Bar-Yossef et al. (2006). In…

In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…

In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and undirected graphs, therefore the algorithms for undirected…

In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…

A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of balanced spanning trees in the random geometric graph…

Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with…

The (univariate) avalanche polynomial of a graph, introduced by Cori, Dartois and Rossin in 2006, captures the distribution of the length of (principal) avalanches in the abelian sandpile model. This polynomial has been used to show that…

We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…

The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a…

Let $N\geq 2$ be an integer, a (1, $N$)-periodic graph $G$ is a periodic graph whose vertices can be partitioned into two sets $V_1=\{v\mid\sigma(v)=v\}$ and $V_2=\{v\mid\sigma^i(v)\neq v\ \mbox{for any}\ 1<i<N\}$, where $\sigma$ is an…

We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the…

We obtain an exact formula for the probability that a uniformly random spanning tree of the $2$-by-$n$ square grid is ``balanced'' in the sense that it has an edge whose removal partitions its vertices into two sets of equal size. We…

Graph parameters measure the amount of structure (or lack thereof) in a graph that makes it amenable to being decomposed in a way that facilitates dynamic programming. Graph decompositions and their associated parameters are important both…

We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…

We study the minimum spanning tree distribution on the space of spanning trees of the $n$-by-$n$ grid for large $n$. We establish bounds on the decay rates of the probability of the most and the least probable spanning trees as…

In this work, we study methodical decomposition of an undirected, unweighted complete graph ($K_n$ of order $n$, size $m$) into minimum number of edge-disjoint trees. We find that $x$, a positive integer, is minimum and…

Let $k$, $d$ be a positive integer, $G$ be a connected graph of order $n$, $T$ be a tree. The leaf distance of a tree is defined as the minimum distance between any two leaves. For $v\in V(T)$, the leaf degree of $v$ in $T$ is the number of…

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…