English
Related papers

Related papers: Expanders have a spanning Lipschitz subgraph with …

200 papers

We show that for sufficiently large $d$ and for $t\geq d+1$, there is a graph $G$ with average degree $(1-\varepsilon)\lambda t \sqrt{\ln d}$ such that almost every graph $H$ with $t$ vertices and average degree $d$ is not a minor of $G$,…

Combinatorics · Mathematics 2020-12-14 Sergey Norin , Bruce Reed , Andrew Thomason , David R. Wood

A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the…

Combinatorics · Mathematics 2013-05-21 Asaf Shapira , Benny Sudakov

The Bandwidth theorem of B\"ottcher, Schacht and Taraz gives a condition on the minimum degree of an $n$-vertex graph $G$ that ensures $G$ contains every $r$-chromatic graph $H$ on $n$ vertices of bounded degree and of bandwidth $o(n)$,…

Combinatorics · Mathematics 2020-11-11 Katherine Staden , Andrew Treglown

An amply regular graph is a regular graph such that any two adjacent vertices have $\alpha$ common neighbors and any two vertices with distance $2$ have $\beta$ common neighbors. We prove a sharp lower bound estimate for the Lin--Lu--Yau…

Combinatorics · Mathematics 2024-06-12 Xueping Huang , Shiping Liu , Qing Xia

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Group Theory · Mathematics 2022-08-25 Sam Shepherd , Giles Gardam , Daniel J. Woodhouse

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

Combinatorics · Mathematics 2022-09-07 Stefan Steinerberger

Under suitable conditions on the range of the Gauss map of a complete submanifold of Euclidean space with parallel mean curvature, we construct a strongly subharmonic function and derive a-priori estimates for the harmonic Gauss map. The…

Differential Geometry · Mathematics 2010-09-21 J. Jost , Y. L. Xin , Ling Yang

A regular equivalence between two graphs $\Gamma,\Gamma'$ is a pair of uniformly proper Lipschitz maps $V\Gamma\to V\Gamma'$ and $V\Gamma'\to V\Gamma$. Using separation profiles we prove that there are $2^{\aleph_0}$ regular equivalence…

Group Theory · Mathematics 2016-09-20 David Hume

Let f:\Sigma_1 --> \Sigma_2 be a map between compact Riemannian manifolds of constant curvature. This article considers the evolution of the graph of f in the product of \Sigma_1 and \Sigma_2 by the mean curvature flow. Under suitable…

Differential Geometry · Mathematics 2009-11-07 Mu-Tao Wang

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

Differential Geometry · Mathematics 2021-09-21 Qi Ding , J. Jost , Y. L. Xin

Let $G$ be an $n$-vertex graph with Laplacian eigenvalues $0=\lambda_1(G)\le \lambda_2(G)\le\cdots\le \lambda_n(G)$. Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular graphs, Spielman conjectured that, for every…

Combinatorics · Mathematics 2026-04-21 Jie Ma , Quanyu Tang , Yuchang Wang , Zhiheng Zheng

In this paper we study the fundamental problem of finding small dense subgraphs in a given graph. For a real number $s>2$, we prove that every graph on $n$ vertices with average degree at least $d$ contains a subgraph of average degree at…

Combinatorics · Mathematics 2022-07-11 Oliver Janzer , Benny Sudakov , István Tomon

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…

Combinatorics · Mathematics 2021-11-25 Jürgen Jost , Dong Zhang

We study expansions near the boundary of solutions to the Dirichlet problem for minimal graphs in the hyperbolic space and prove the local convergence of such expansions if the boundary is locally analytic. As a consequence, we prove a…

Analysis of PDEs · Mathematics 2018-01-26 Qing Han , Xumin Jiang

The classical McShane-Whitney extension theorem for Lipschitz functions is refined by showing that for a closed subset of the domain, it remains valid for any interval of the real line. This result is also extended to the setting of locally…

General Topology · Mathematics 2025-08-08 Valentin Gutev

We characterise the big pieces of Lipschitz graphs property in terms of projections. Roughly speaking, we prove that if a large subset of an $n$-Ahlfors-David regular set $E \subset \mathbb{R}^d$ has plenty of projections in $L^{2}$, then a…

Classical Analysis and ODEs · Mathematics 2018-08-10 Henri Martikainen , Tuomas Orponen

When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…

Combinatorics · Mathematics 2017-01-06 Sébastien Martineau

These notes constitute a survey on the geometric properties of globally subanalytic sets. We start with their definition and some fundamental results such as Gabrielov's Complement Theorem or existence of cell decompositions. We then give…

Algebraic Geometry · Mathematics 2025-08-01 Guillaume Valette

We study the local geometry of the space of horizontal curves with endpoints freely varying in two given submanifolds $\mathcal P$ and $\mathcal Q$ of a manifold $\mathcal M$ endowed with a distribution $\mathcal D\subset T\M$. We give a…

Differential Geometry · Mathematics 2007-05-23 Paolo Piccione , Daniel V. Tausk

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár