English
Related papers

Related papers: Non-amenable products are not treeable

200 papers

The greedy tree $\mathcal{G}(D)$ and the $\mathcal{M}$-tree $\mathcal{M}(D)$ are known to be extremal among trees with degree sequence $D$ with respect to various graph invariants. This paper provides a general theorem that covers a large…

Combinatorics · Mathematics 2020-08-04 Eric O. D. Andriantiana , Valisoa Razanajatovo Misanantenaina , Stephan Wagner

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

Group Theory · Mathematics 2020-07-23 Nicolas Radu

An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…

Logic · Mathematics 2010-07-26 Olivier Finkel , Stevo Todorcevic

We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…

Combinatorics · Mathematics 2019-04-29 Cristina G. Fernandes , César Hernández-Vélez , Orlando Lee , José C. de Pina

We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…

Combinatorics · Mathematics 2011-06-16 Mark Pankov

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path--an xy-monotone path in an appropriately rotated coordinate system. We show…

Computational Geometry · Computer Science 2017-07-04 Anna Lubiw , Joseph O'Rourke

A temporal graph is a graph whose edges appear at certain points in time. These graphs are temporally connected (in class TC) if all vertices can reach each other by temporal paths (traversing the edges in chronological order). Reachability…

Discrete Mathematics · Computer Science 2026-04-21 Arnaud Casteigts , Timothée Corsini , Nils Morawietz

We show that if $X$ is an indecomposable $PD_3$-complex and $\pi_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then $X$ is orientable, the underlying graph is a tree, all the edge…

Geometric Topology · Mathematics 2014-07-22 J. A. Hillman

Let $X$ be a smooth manifold belonging to one of these three collections: acyclic manifolds (compact or not, possibly with boundary), compact connected manifolds (possibly with boundary) with nonzero Euler characteristic, integral homology…

Differential Geometry · Mathematics 2019-04-24 Ignasi Mundet i Riera

We study extremal properties of finite ultrametric spaces $X$ and related properties of representing trees $T_X$. The notion of weak similarity for such spaces is introduced and related morphisms of labeled rooted trees are found. It is…

Metric Geometry · Mathematics 2017-12-19 O. Dovgoshey , E. Petrov , H. -M. Teichert

Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…

Group Theory · Mathematics 2012-01-19 Pierre-Emmanuel Caprace , Tom De Medts

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Combinatorics · Mathematics 2022-12-01 K. V. Chelpanov

Given a group $G$, we define the power graph $\mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $\langle x \rangle \subseteq \langle y \rangle$ or $\langle y \rangle…

Group Theory · Mathematics 2022-12-12 Sakineh Rahbariyan

A subset $S$ of a group $G$ invariably generates $G$ if $G$ is generated by $\{ s^g(s) | s\in S\} $ for any choice of $g(s)\in G, s\in S$. In case $G$ is topological one defines similarly the notion of topological invariable generation. A…

Group Theory · Mathematics 2020-04-23 Gil Goffer , Gennady A. Noskov

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

Group Theory · Mathematics 2021-02-15 Daniele Garzoni

Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…

Metric Geometry · Mathematics 2014-03-18 A. O. Ivanov , A. A. Tuzhilin

We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…

Group Theory · Mathematics 2012-07-10 M. Burger , A. Iozzi , N. Monod

We consider noncommutative geometries obtained from a triangular Drinfeld twist. This allows to construct and study a wide class of noncommutative manifolds and their deformed Lie algebras of infinitesimal diffeomorphisms. This way symmetry…

Quantum Algebra · Mathematics 2010-05-13 Paolo Aschieri

It is proved that, up to isomorphism, there are only two directed trees that admit a hyponormal weighted shift with nonzero weights whose square has trivial domain. These are precisely those enumerable directed trees, one with root, the…

Functional Analysis · Mathematics 2011-04-28 Z. J. Jablonski , I. B. Jung , J. Stochel
‹ Prev 1 4 5 6 7 8 10 Next ›