Related papers: Spanning trees and their relations in Galois cover…

We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the…

We consider the Ihara zeta function $\zeta(u,X//G)$ and Artin-Ihara $L$-function of the quotient graph of groups $X//G$, where $G$ is a group acting on a finite graph $X$ with trivial edge stabilizers. We determine the relationship between…

The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…

We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…

Let $\mathcal{G}$ be the set of simple graphs (or multigraphs) $G$ such that for each $G \in \mathcal{G}$ there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\subseteq V(G)$ satisfying $V(G)\setminus(V_{1} \cup…

Let $K$ be a number field and $k\geq 2$ be an integer. Let $(n_1,n_2, \dots, n_k)$ be a vector with entries $n_i\in \mathbb{Z}_{\geq 2}$. Given a number field extension $L/K$, we denote by $\widetilde{L}$ the Galois closure of $L$ over $K$.…

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 give a complete description of the arboreal Galois representation of a certain postcritically finite cubic polynomial over a large class of number fields and for a large class of basepoints. This is the first such example that is not…

In this paper we consider the original and different generalizations of Postnikov-Shapiro algebra which enumerate forests and trees of graphs, see~\cite{PSh}. Our main result is that the algebra counting forests depends only on graphical…

Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…

We describe Galois connections which arise between two kinds of combinatorial structures, both of which generalize trees with labelled leaves, and then apply those connections to a family of polytopes. The graphs we study can be imbued with…

Let $G$ be a connected $n$-vertex graph in a proper minor-closed class $\mathcal G$. We prove that the extension complexity of the spanning tree polytope of $G$ is $O(n^{3/2})$. This improves on the $O(n^2)$ bounds following from the work…

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…

We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…

Let $R$ and $B$ be a set of red points and a set of blue points in the plane, respectively, such that $R\cup B$ is in general position, and let $f:R \to \{2,3,4, \ldots \}$ be a function. We show that if $2\le |B|\le \sum_{x\in R}(f(x)-2) +…

In this paper, we explore the properties of zeta functions associated with infinite graphs of groups that arise as quotients of cuspidal tree-lattices, including all non-uniform arithmetic quotients of the tree of rank one Lie groups over…

In this paper, using matrix techniques, we compute the Ihara-zeta function and the number of spanning trees of the join of two semi-regular bipartite graphs. Furthermore, we show that the spectrum and the zeta function of the join of two…

We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…

Halin proved in 1978 that there exists a normal spanning tree in every connected graph $G$ that satisfies the following two conditions: (i) $G$ contains no subdivision of a `fat' $K_{\aleph_0}$, one in which every edge has been replaced by…