Related papers: Possible heights of graph transformation groups

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

Let $G$ be a graph and $\mathcal{H}$ be a hypergraph both on the same vertex set. We say that a hypergraph $\mathcal{H}$ is a \emph{Berge}-$G$ if there is a bijection $f : E(G) \rightarrow E(\mathcal{H})$ such that for $e \in E(G)$ we have…

We consider a few types of bounded homomorphisms on a topological group. These classes of bounded homomorphisms are, in a sense, weaker than the class of continuous homomorphisms. We show that with appropriate topologies each class of these…

Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

Let X \subset R be a bounded set; we introduce a formula that calculates the upper graph box dimension of X (i.e.the supremum of the upper box dimension of the graph over all uniformly continuous functions defined on X). We demonstrate the…

Let $Q^d$ be the $d$-dimensional binary hypercube. We say that $P=\{v_1,\ldots, v_k\}$ is an increasing path of length $k-1$ in $Q^d$, if for every $i\in [k-1]$ the edge $v_iv_{i+1}$ is obtained by switching some zero coordinate in $v_i$ to…

We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…

We define two classes of topological infinite degree covering maps modeled on two families of transcendental holomorphic maps. The first, which we call exponential maps of type $(p,q)$, are branched covers and is modeled on transcendental…

We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…

A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…

The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real…

We pursue the study of $\mathrm L^1$ full groups of graphings and of the closures of their derived groups, which we call derived $\mathrm L^1$ full groups. Our main result shows that aperiodic probability measure-preserving actions of…

Let $G$ be a compact connected Lie group and let $\xi,\nu$ be complex vector bundles over the classifying space $BG$. The problem we consider is whether $\xi$ contains a subbundle which is isomorphic to $\nu$. The necessary condition is…

An extremal graph for a given graph $H$ is a graph with maximum number of edges on fixed number of vertices without containing a copy of $H$. The $k$-th power of a path is a graph obtained from a path and joining all pair of vertices of the…

In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an…

Conditions on a topological space $X$ under which the space $C(X,\mathbb{R})$ of continuous real-valued maps with the Isbell topology $\kappa $ is a topological group (topological vector space) are investigated. It is proved that the…

The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In…