Related papers: Some Graftings of Complex Projective Structures wi…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…

A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both…

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of…

This paper studies when an arithmetical equivalence relation $E$ can be realized as the connectedness relation of a graph $G$ which is simpler to define than $E$. Several examples of such equivalence relations are established. In…

We study the preservation of semisimplicity for holonomic D-modules with respect to the direct and inverse image of mainly finite maps $\pi : X \to Y$ of smooth varieties. A natural filtration of the direct image $\pi_+({\mathcal O}_X)$ is…

We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

Given a closed, oriented surface X of genus g>1, and a semisimple Lie group G, let R_G be the moduli space of reductive representations of the fundamental group of X in G. We determine the number of connected components of R_PGL(n,R), for…

We show that $3$-Sasaki structures admit a natural description in terms of projective differential geometry. This description provides a concrete link between $3$-Sasaki structures and several other geometries and constructions via a single…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…

Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry. We study the Schreier structures with which…

Though the uniformization theorem guarantees an equivalence of Riemann surfaces and smooth algebraic curves, moving between analytic and algebraic representations is inherently transcendental. Our analytic curves identify pairs of circles…

Connectivity is a homotopy invariant property of separable C*-algebras which has three notable consequences: absence of nontrivial projections, quasidiagonality and a more geometric realization of KK-theory for nuclear C*-algebras using…

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

In this paper, we establish a structure theorem for connected graded Hopf algebras over a field of characteristic $0$ by claiming the existence of a family of homogeneous generators and a total order on the index set that satisfy some…

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…