Related papers: Kida's formula for graphs with ramifications
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Iwasawa made the fundamental discovery that there is a close connection between the ideal class groups of $\mathbb{Z}_{p}$-extensions of cyclotomic fields and the $p$-adic analogue of Riemann's zeta functions…
In this paper, we develop a new method to produce explicit formulas for the number $\tau(n)$ of spanning trees in the undirected circulant graphs $C_{n}(s_1,s_2,\ldots,s_k)$ and $C_{2n}(s_1,s_2,\ldots,s_k,n).$ Also, we prove that in both…
Consider an infinite planar graph with uniform polynomial growth of degree d > 2. Many examples of such graphs exhibit similar geometric and spectral properties, and it has been conjectured that this is necessary. We present a family of…
Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
We present certain results on the Iwasawa theory of an abelian variety with potentially good ordinary reduction at all primes above $p$. These are then applied to study Diophantine stability and integally Diophantine extensions. Along the…
We establish a new Iwasawa theory for the kernel of Frobenius on Jacobians of curves in geometric $\mathbf{Z}_p$-towers over the projective line in characteristic $p$, thereby proving several of the main conjectures of [arXiv:2107.12555].
Hurwitz theory provides a large variety of enumerative problems related to algebraic geometry, mathematical physics, and combinatorics. We give a general framework to approach the large genus asymptotics of Hurwitz theory using only…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…
It is known that every surface-link can be presented by a marked graph diagram, and such a diagram presentation is unique up to moves called Yoshikawa moves. G. Kuperberg introduced a regular isotopy invariant, called the quantum A_2…
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
We produce generalizations of Iwasawa's `Riemann-Hurwitz' formula for number fields. These generalizations apply to cyclic extensions of number fields of degree p^n for any positive integer n. We first deduce some congruences and…
Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…
We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…
Our primary goal in this article is to study the Iwasawa theory for semi-ordinary families of automorphic forms on $\mathrm{GL}_2\times\mathrm{Res}_{K/\mathbb{Q}}\mathrm{GL}_1$, where $K$ is an imaginary quadratic field where the prime $p$…