English
Related papers

Related papers: Reflective Graphs, Ollivier curvature, effective d…

200 papers

Analytic self-maps of the unit disc whose hyperbolic derivative is uniformly bounded by a constant smaller than one, are called contractive. We describe these maps in terms of their Aleksandrov-Clark measures and in terms of their…

Complex Variables · Mathematics 2026-04-16 Artur Nicolau

Invertible compositions of one-dimensional maps are studied which are assumed to include maps with non-positive Schwarzian derivative and others whose sum of distortions is bounded. If the assumptions of the Koebe principle hold, we show…

Dynamical Systems · Mathematics 2016-09-06 Grzegorz Swiatek

A subset $X$ of vertices in a graph $G$ is a {\em diameter 2 subset} if the distance of any two vertices of $X$ is at most two {\em in $G[X]$}. Relaxing this notion, a subset $X$ of vertices in a graph $G$ is a {\em 2-reachable subset} if…

Combinatorics · Mathematics 2025-06-16 Andras Gyarfas , Gabor N. Sarkozy

The Freund family of distributions becomes a Riemannian 4-manifold with Fisher information as metric; we derive the induced $\alpha$-geometry, i.e., the $\alpha$-curvature, $\alpha$-Ricci curvature with its eigenvales and eigenvectors, the…

Differential Geometry · Mathematics 2007-05-23 Khadiga Arwini , C. T. J. Dodson

In this paper the class of Brauer graph algebras is proved to be closed under derived equivalence. For that we use the rank of the maximal torus of the identity component $Out^0(A)$ of the group of outer automorphisms of a symmetric stably…

Representation Theory · Mathematics 2021-11-30 Mikhail Antipov , Alexandra Zvonareva

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

Combinatorics · Mathematics 2019-01-03 Agelos Georgakopoulos , Matthias Hamann

We prove that for a large family of product graphs, and for Kneser graphs $K(n,\alpha n)$ with fixed $\alpha <1/2$, the following holds. Any set of vertices that spans a small proportion of the edges in the graph can be made independent by…

Combinatorics · Mathematics 2018-01-23 Ehud Friedgut , Oded Regev

We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. More precisely, we show that a graph having modularity…

Combinatorics · Mathematics 2023-12-13 Baptiste Louf , Colin McDiarmid , Fiona Skerman

Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…

Probability · Mathematics 2014-01-24 Agelos Georgakopoulos

We collect a number of striking recent results in a study of dimers on infinite regular bipartite lattices and also on regular bipartite graphs. We clearly separate rigorously proven results from conjectures. A primary goal is to show…

Mathematical Physics · Physics 2022-10-17 Paul Federbush

In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…

Combinatorics · Mathematics 2024-01-05 Serena An , Holden Mui

We introduce the notion of reflections for selfinjective algebras from the point of view of torsion theories induced by two-term tilting complexes. As an application, we determine the transformations of Brauer trees associated with…

Representation Theory · Mathematics 2015-11-06 Hiroki Abe

This paper considers the degree-diameter problem for undirected circulant graphs. The focus is on extremal graphs of given (small) degree and arbitrary diameter. The published literature only covers graphs of up to degree 7. The approach…

Combinatorics · Mathematics 2014-08-06 Robert Lewis

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

Combinatorics · Mathematics 2010-01-21 David Eppstein

This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods based on equitable and orbit partitions can be complex. Our…

Combinatorics · Mathematics 2025-11-26 Ali Zafari , Saeid Alikhani

For a proper action by a locally compact group $G$ on a manifold $M$ with a $G$-equivariant Spin-structure, we obtain obstructions to the existence of complete $G$-invariant Riemannian metrics with uniformly positive scalar curvature. We…

Differential Geometry · Mathematics 2024-09-02 Hao Guo , Peter Hochs , Varghese Mathai

We prove that for every oriented graph $D$ and every choice of positive integers $k$ and $\ell$, there exists an oriented graph $D^*$ along with a surjective homomorphism $\psi\colon V(D^*) \to V(D)$ such that: (i) girth$(D^*) \geq\ell$;…

Combinatorics · Mathematics 2023-07-19 P. Mark Kayll , Michael Morris

On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…

Combinatorics · Mathematics 2020-02-11 Yohji Akama , Bobo Hua , Yanhui Su , Haohang Zhang

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Combinatorics · Mathematics 2022-08-10 Ferdinand Ihringer

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

Spectral Theory · Mathematics 2019-10-04 J. B. Kennedy