Related papers: Kida's formula for graphs with ramifications

Booher, Cais, Kramer-Miller and Upton study a class of $\mathbf{Z}_p$-tower of curves in characteristic $p$ with ramification controlled by an integer $d$. In the special case that $d$ divides $p-1$, they prove a formula for the higher…

We prove that the Kuramoto model on a graph can contain infinitely many non-equivalent stable equilibria. More precisely, we prove that for every positive integer d there is a connected graph such that the set of stable equilibria contains…

We construct classes of graphs that are variants of the so-called layered wheel. One of their key properties is that while the treewidth is bounded by a function of the clique number, the construction can be adjusted to make the dependance…

Let $L/K$ be a finite Galois extension of $p$-adic fields and let $L_{\infty}$ be the unramified $\mathbb Z_p$-extension of $L$. Then $L_{\infty}/K$ is a one-dimensional $p$-adic Lie extension. In the spirit of the main conjectures of…

This paper studies the relation among the number of spanning trees of intermediate graphs in a Galois cover, building on results for $(\mathbb{Z}/2\mathbb{Z})^m$-covers previously established by Hammer, Mattman, Sands, and Valli\`{e}res. We…

Let A be the algebra generated by the power series \sum n^{n-1} q^n/n! and \sum n^n q^n /n! . We prove that many natural generating functions lie in this algebra: those appearing in graph enumeration problems, in the intersection theory of…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

To extend Iwasawa's classical theorem from ${\mathbb Z}_p$-towers to ${\mathbb Z}_p^d$-towers, Greenberg conjectured that the exponent of $p$ in the $n$-th class number in a ${\mathbb Z}_p^d$-tower of a global field $K$ ramified at finitely…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

Let $A$ be an ordinary elliptic curve over a global function field $K$ of characteristic $p$, assumed semistable at every place, and let $L/K$ be a $\mathbb{Z}_p^d$-extension ramified only at finitely many places where $A$ has ordinary…

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…

Given an odd prime number $p$ and an imaginary quadratic field $K$, we establish a relationship between the $p$-rank of the class group of $K$, and the classical $\lambda$-invariant of the cyclotomic $\mathbb{Z}_p$-extension of $K$.…

A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called localizable graphs and defined as graphs having a partition of…

We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.

We consider ramified coverings of P^1 with arbitrary ramification type over 0 and infinity and simple ramifications elsewhere and prove that the generating function for the numbers of such coverings is a tau-function for the Toda lattice…

Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…

We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factorizations. For $(d,r)$-regular hypergraphs, we show that a modified…