Results 11 to 20 of about 55 (55)
Deforming cubulations of hyperbolic groups
Abstract We describe a procedure to deform cubulations of hyperbolic groups by ‘bending hyperplanes’. Our construction is inspired by related constructions like Thurston's Mickey Mouse example, walls in fibred hyperbolic 3‐manifolds and free‐by‐Z groups, and Hsu–Wise turns.
Elia Fioravanti, Mark Hagen
wiley +1 more source
A new obstruction for normal spanning trees
Abstract In a paper from 2001 (Journal of the LMS), Diestel and Leader offered a proof that a connected graph has a normal spanning tree if and only if it has no minor obtained canonically from either an (ℵ0,ℵ1)‐regular bipartite graph or an order‐theoretic Aronszajn tree. In particular, this refuted an earlier conjecture of Halin's that only the first
Max Pitz
wiley +1 more source
Sparse Kneser graphs are Hamiltonian
Abstract For integers k⩾1 and n⩾2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k‐element subsets of {1,…,n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k+1,k) are also known as the odd graphs.
Torsten Mütze +2 more
wiley +1 more source
(Un)distorted stabilisers in the handlebody group
Abstract We study geometric properties of stabilisers in the handlebody group. We find that stabilisers of meridians are undistorted, while stabilisers of primitive curves or annuli are exponentially distorted for large enough genus.
Sebastian Hensel
wiley +1 more source
Quasi‐isometric diversity of marked groups
Abstract We use basic tools of descriptive set theory to prove that a closed set S of marked groups has 2ℵ0 quasi‐isometry classes, provided that every non‐empty open subset of S contains at least two non‐quasi‐isometric groups. It follows that every perfect set of marked groups having a dense subset of finitely presented groups contains 2ℵ0 quasi ...
A. Minasyan, D. Osin, S. Witzel
wiley +1 more source
The extremal number of longer subdivisions
Abstract For a multigraph F, the k‐subdivision of F is the graph obtained by replacing the edges of F with pairwise internally vertex‐disjoint paths of length k+1. Conlon and Lee conjectured that if k is even, then the (k−1)‐subdivision of any multigraph has extremal number O(n1+1k), and moreover, that for any simple graph F there exists ε>0 such that ...
Oliver Janzer
wiley +1 more source
On correlation of hyperbolic volumes of fullerenes with their properties
We observe that fullerene graphs are one-skeletons of polyhedra, which can be realized with all dihedral angles equal to π /2 in a hyperbolic 3-dimensional space. One of the most important invariants of such a polyhedron is its volume.
Egorov A. A., Vesnin A Yu.
doaj +1 more source
Neighborhood hypergraph model for topological data analysis
Hypergraph, as a generalization of the notions of graph and simplicial complex, has gained a lot of attention in many fields. It is a relatively new mathematical model to describe the high-dimensional structure and geometric shapes of data sets.
Liu Jian, Chen Dong, Li Jingyan, Wu Jie
doaj +1 more source
Computing the Hosoya Polynomial of M‐th Level Wheel and Its Subdivision Graph
The determination of Hosoya polynomial is the latest scheme, and it provides an excellent and superior role in finding the Weiner and hyper‐Wiener index. The application of Weiner index ranges from the introduction of the concept of information theoretic analogues of topological indices to the use as major tool in crystal and polymer studies.
Peng Xu +6 more
wiley +1 more source
The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram
The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram.
Akopyan Arsenyi, Edelsbrunner Herbert
doaj +1 more source

