中文
相关论文

相关论文: On the separation profile of infinite graphs

200 篇论文

We define three different isogeny graphs of principally polarized superspecial abelian varieties, prove foundational results on them, and explain their role in number theory and geometry. This is background to joint work with Yevgeny…

数论 · 数学 2021-05-04 Bruce W. Jordan

We study a finite sequence of graphs, beginning with the curve graph and ending with a graph quasi-isometric to a tree. There is a Lipschitz map from one graph in the sequence to the next. This sequence was first introduced by Hamenst\"adt.…

几何拓扑 · 数学 2025-10-07 Mladen Bestvina , Kenneth Bromberg , Alexander J. Rasmussen

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

组合数学 · 数学 2013-04-09 Mei Lu , Daqing Wan , Li-Ping Wang , Xiao-Dong Zhang

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

几何拓扑 · 数学 2014-10-14 Ariadna Fossas , Hugo Parlier

Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…

统计力学 · 物理学 2015-06-24 R. Burioni , D. Cassi , C. Destri

We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.

组合数学 · 数学 2015-03-18 Maya Stein

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…

组合数学 · 数学 2019-06-26 David Conlon

Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…

离散数学 · 计算机科学 2017-12-29 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Maximilian Pfister , Torsten Ueckerdt

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

几何拓扑 · 数学 2022-09-23 Jacob Russell , Kate M. Vokes

We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…

几何拓扑 · 数学 2009-09-29 Cornelia Drutu , Mark Sapir

We show that the graphs of nonseparating curves for oriented finite type surfaces are uniformly hyperbolic. Our proof follows the proof of uniform hyperbolicity of the graphs of curves for closed surfaces due to Przytycki-Sisto, while…

几何拓扑 · 数学 2020-04-06 Alexander J. Rasmussen

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

度量几何 · 数学 2025-08-07 Wanying Huang , David Hume , Samuel J. Kelly , Ryan Lam

Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…

微分几何 · 数学 2015-05-13 Subhojoy Gupta , Michael Wolf

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

离散数学 · 计算机科学 2018-03-26 Didier Caucal

We recall and define various kinds of supersingular $\ell$-isogeny graphs and precise graph isomorphism with a corresponding quaternion $\ell$-ideal graph. In particular, we introduce the notion of double-orientations on supersingular…

数论 · 数学 2025-10-20 Do Eon Cha , Imin Chen

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

组合数学 · 数学 2007-05-23 Bernhard Krön

We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…

组合数学 · 数学 2026-04-08 Mónica A. Reyes , Cristina Dalfó , Miquel Àngel Fiol

We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…

组合数学 · 数学 2018-10-15 Ioannis Ivrissimtzis , Norbert Peyerimhoff , Alina Vdovina

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

群论 · 数学 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano