English
Related papers

Related papers: Fat minors cannot be thinned (by quasi-isometries)

200 papers

A subgroup $H\leq G$ is said to be almost normal if every conjugate of $H$ is commensurable to $H$. If $H$ is almost normal, there is a well-defined quotient space $G/H$. We show that if a group $G$ has type $F_{n+1}$ and contains an almost…

Group Theory · Mathematics 2021-09-15 Alexander Margolis

We show that an enlargeable Riemannian metric on a (possibly nonspin) manifold cannot have uniformly positive scalar curvature. This extends a well-known result of Gromov and Lawson to the nonspin setting. We also prove that every…

Geometric Topology · Mathematics 2021-01-01 Simone Cecchini , Thomas Schick

We show that geometric thickness and book thickness are not asymptotically equivalent: for every t, there exists a graph with geometric thickness two and book thickness >= t.

Combinatorics · Mathematics 2007-05-23 David Eppstein

We show that every word hyperbolic, surface-by-(noncyclic) free group Gamma is as rigid as possible: the quasi-isometry group of Gamma equals the abstract commensurator group Comm(Gamma), which in turn contains Gamma as a finite index…

Group Theory · Mathematics 2007-05-23 Benson Farb , Lee Mosher

In a recent paper Jorge and Mercuri proved that the image of Gauss map of a complete non flat minimal surfaces in R3 with finite total curvature omits at most 2 points. In this work we follow their idea and prove 3a similar result for CMC-1…

Differential Geometry · Mathematics 2019-06-24 Nicolas A. de Andrade , Luquesio P. Jorge

A graph polynomial $P$ is weakly distinguishing if for almost all finite graphs $G$ there is a finite graph $H$ that is not isomorphic to $G$ with $P(G)=P(H)$. It is weakly distinguishing on a graph property $\mathcal{C}$ if for almost all…

Combinatorics · Mathematics 2020-10-21 Johann A. Makowsky , Vsevolod Rakita

By using the Szemer\'edi Regularity Lemma, Alon and Sudakov recently extended the classical Andr\'asfai-Erd\~os-S\'os theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is…

Combinatorics · Mathematics 2011-02-17 Peter Allen

A graph G on omega_1 is called <omega-smooth if for each uncountable subset W of omega_1, G is isomorphic to G[W-W'] for some finite W'. We show that in various models of ZFC if a graph G is <omega-smooth then G is necessarily trivial, i.e,…

Logic · Mathematics 2010-03-17 Lajos Soukup

We investigate fat Hoffman graphs with smallest eigenvalue at least -3, using their special graphs. We show that the special graph S(H) of an indecomposable fat Hoffman graph H is represented by the standard lattice or an irreducible root…

Combinatorics · Mathematics 2012-10-02 Hye Jin Jang , Jack Koolen , Akihiro Munemasa , Tetsuji Taniguchi

A graph $G$ is said to be {\em hom-idempotent} if there is a homomorphism from $G^2$ to $G$, and {\em weakly hom-idempotent} if for some $n \geq 1$ there is a homomorphism from $G^{n+1}$ to $G^n$. Larose et al. [{\em Eur. J. Comb.…

Combinatorics · Mathematics 2016-04-26 Pablo Torres , Mario Valencia-Pabon

We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $\epsilon:=\epsilon(k,m)>0$ so that the following holds. For every graph $H$ with chromatic number $k$ from…

Combinatorics · Mathematics 2017-06-20 Noga Alon , Clara Shikhelman

We show that closed hypersurfaces in Euclidean space with nonnegative scalar curvature are weakly mean convex. In contrast, the statement is no longer true if the scalar curvature is replaced by the k-th mean curvature, for k greater than…

Differential Geometry · Mathematics 2013-05-03 Lan-Hsuan Huang , Damin Wu

Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…

Differential Geometry · Mathematics 2020-11-18 Koji Fujiwara , Takashi Shioya

A set $X \subseteq V(G)$ in a graph $G$ is $(q,k)$-unbreakable if every separation $(A,B)$ of order at most $k$ in $G$ satisfies $|A \cap X| \leq q$ or $|B \cap X| \leq q$. In this paper, we prove the following result: If a graph $G$…

Combinatorics · Mathematics 2022-10-27 Daniel Lokshtanov , Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh

In this paper, we establish a "pseudo-effective" version of the holonomy principle for compact K\"{a}hler manifolds with nonnegative holomorphic sectional curvature. As applications, we prove that if a compact complex manifold $M$ admits a…

Differential Geometry · Mathematics 2024-08-07 Shiyu Zhang , Xi Zhang

Given two graphs $G$ and $H$, we define $\textsf{v-cover}_{H}(G)$ (resp. $\textsf{e-cover}_{H}(G)$) as the minimum number of vertices (resp. edges) whose removal from $G$ produces a graph without any minor isomorphic to ${H}$. Also…

Data Structures and Algorithms · Computer Science 2017-01-23 Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos

Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\varepsilon n$ edges from $G$ to make it $H$-minor free (for some small constant $\varepsilon > 0$). We give an…

Discrete Mathematics · Computer Science 2018-08-29 Akash Kumar , C. Seshadhri , Andrew Stolman

In 1971, Tutte wrote in an article that "it is tempting to conjecture that every 3-connected bipartite cubic graph is hamiltonian". Motivated by this remark, Horton constructed a counterexample on 96 vertices. In a sequence of articles by…

Combinatorics · Mathematics 2021-10-26 Gunnar Brinkmann , Jan Goedgebeur , Brendan D. McKay

We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let $G$ be a group that is one-ended, hyperbolic relative to…

Group Theory · Mathematics 2021-10-29 Sam Shepherd , Daniel J. Woodhouse

We consider stabilities for the weighted length or energy functional of a discrete map from a finite weighted graph $(X,m_{E})$ into a smooth Riemannian manifold $(M,g)$. We prove the non-existence of a stable discrete minimal immersion or…

Differential Geometry · Mathematics 2023-06-27 Toru Kajigaya
‹ Prev 1 4 5 6 7 8 10 Next ›