相关论文: Maximally symmetric trees

We study the problem of maximizing the number of full degree vertices in a spanning tree $T$ of a graph $G$; that is, the number of vertices whose degree in $T$ equals its degree in $G$. In cubic graphs, this problem is equivalent to…

The $\sigma$-irregularity index of a graph is defined as the sum of squared degree differences over all edges and provides a sensitive measure of structural heterogeneity. In this paper, we study the problem of maximizing $\sigma(T)$ among…

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give…

In this paper we continue our investigation of the global categorical symmetries that arise when gauging finite higher groups and their higher subgroups with discrete torsion. The motivation is to provide a common perspective on the…

We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…

We show that an infinite group is definable in any non trivial geometric $C$-minimal structure which is definably maximal and does not have any definable bijection between a bounded interval and an unbounded one in its canonical tree. No…

Let K be a simple and simply connected compact Lie group. We call a (twisted) quasi-Hamiltonian K-manifold M a quasi-Hamiltonian model space if it is multiplicity free and its momentum map is surjective. We explicitly identify the subgroups…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

A group $G$ is said to be equationally Noetherian if every system of equations in $G$ is equivalent to a finite subsystem. We show that all free-by-cyclic groups are equationally Noetherian. As a corollary, we deduce that the set of…

Motivated by the work of Bestvina-Feighn ([BF92]) and Mj-Sardar ([MS12]), we define trees of metric bundles subsuming both the trees of metric spaces and the metric bundles. Then we prove a combination theorem for these spaces. More…

This is an account of the theory of JSJ decompositions of finitely generated groups, as developed in the last twenty years or so. We give a simple general definition of JSJ decompositions (or rather of their Bass-Serre trees), as maximal…

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

A complete classification of isotropic vector equations of the geometric type that possess higher symmetries is proposed. New examples of integrable multi-component systems of the geometric type and their auto-Backlund transformations are…

We prove that a permutation group in which different finite sets have different stabilizers cannot satisfy any group law. For locally compact topological groups with this property we show that almost all finite subsets of the group generate…

This paper proves three different coherence theorems for symmetric monoidal bicategories. First, we show that in a free symmetric monoidal bicategory every diagram of 2-cells commutes. Second, we show that this implies that the free…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…