English
Related papers

Related papers: Some classical model theoretic aspects of bounded …

200 papers

This survey is an extended version of lectures given at the Cornell Probability Summer School 2013. The fundamental facts about the Abelian sandpile model on a finite graph and its connections to related models are presented. We discuss…

Probability · Mathematics 2018-09-13 Antal A. Járai

We investigate the question how `small' a graph can be, if it contains all members of a given class of locally finite graphs as subgraphs or induced subgraphs. More precisely, we give necessary and sufficient conditions for the existence of…

Combinatorics · Mathematics 2022-05-26 Florian Lehner

Suppose $G$ is a graph with degrees bounded by $d$, and one needs to remove more than $\epsilon n$ of its edges in order to make it planar. We show that in this case the statistics of local neighborhoods around vertices of $G$ is far from…

Combinatorics · Mathematics 2008-02-10 Itai Benjamini , Oded Schramm , Asaf Shapira

In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…

Combinatorics · Mathematics 2025-10-23 Agelos Georgakopoulos

In this paper, we study quasi post-critically finite degenerations for rational maps. We construct limits for such degenerations as geometrically finite rational maps on a finite tree of Riemann spheres. We prove the boundedness for such…

Dynamical Systems · Mathematics 2021-12-16 Yusheng Luo

We study foliations of space forms by complete hypersurfaces, under some mild conditions on its higher order mean curvatures. In particular, in Euclidean space we obtain a Bernstein-type theorem for graphs whose mean and scalar curvature do…

Differential Geometry · Mathematics 2009-08-07 A. Caminha , P. Sousa , F. Camargo

The notions of bounded expansion and nowhere denseness have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs. We show…

Discrete Mathematics · Computer Science 2017-07-10 Stephan Kreutzer , Patrice Ossona de Mendez , Roman Rabinovich , Sebastian Siebertz

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

Combinatorics · Mathematics 2023-09-14 Ann-Kathrin Elm , Hendrik Heine

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

Combinatorics · Mathematics 2014-03-26 Sang-il Oum

In this paper we provide an extended formulation for the class of constraint satisfaction problems and prove that its size is polynomial for instances whose constraint graph has bounded treewidth. This implies new upper bounds on extension…

Computational Complexity · Computer Science 2015-04-29 Petr Kolman , Martin Koutecký

For a wide class of groups including polycyclic and finitely generated polynomial growth groups it is proved that the Reidemeister number of an automorphism f is equal to the number of finite-dimensional fixed points of the induced map f^…

Group Theory · Mathematics 2007-05-23 Alexander Fel'shtyn , Evgenij Troitsky

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

Discrete Mathematics · Computer Science 2014-10-24 Abbas Mehrabian

We prove, as our main theorem, the finiteness of topological type of a complete open Riemannian manifold $M$ with a base point $p \in M$ whose radial curvature at $p$ is bounded from below by that of a non-compact model surface of…

Differential Geometry · Mathematics 2011-02-07 Kei Kondo , Minoru Tanaka

We consider finite-sheeted, regular, possibly branched covering spaces of compact surfaces with boundary and the associated liftable and symmetric mapping class groups. In particular, we classify when either of these subgroups coincides…

Geometric Topology · Mathematics 2020-03-11 Tyrone Ghaswala , Alan McLeay

The theory of p-local compact groups, developed in an earlier paper by the same authors, is designed to give a unified framework in which to study the p-local homotopy theory of classifying spaces of compact Lie groups and p-compact groups,…

Algebraic Topology · Mathematics 2014-11-26 Carles Broto , Ran Levi , Bob Oliver

A work of Sorensen is rewritten here to include nontrivial types at the infinite places. This extends results of K. Ribet and R. Taylor on level-raising for algebraic modular forms on D^{\times}, where D is a definite quaternion algebra…

Number Theory · Mathematics 2008-11-26 Yuval Z. Flicker

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

Group Theory · Mathematics 2023-11-15 Frédérique Bassino , Cyril Nicaud , Pascal Weil

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

Geometric Topology · Mathematics 2015-11-03 Yohsuke Watanabe

Let $S$ be an orientable, connected surface with infinitely-generated fundamental group. The main theorem states that if the genus of $S$ is finite and at least 4, then the isomorphism type of the pure mapping class group associated to $S$,…

Geometric Topology · Mathematics 2018-12-19 Priyam Patel , Nicholas G. Vlamis

We give a common matroidal generalisation of `A Cantor-Bernstein theorem for paths in graphs' by Diestel and Thomassen and `A Cantor-Bernstein-type theorem for spanning trees in infinite graphs' by ourselves.

Combinatorics · Mathematics 2022-05-10 Attila Joó
‹ Prev 1 8 9 10 Next ›