Related papers: Graphs, free groups and the Hanna Neumann conjectu…

Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Assuming the absence of Q-points (which is consistent with ZFC) we prove that the free topological group $F(X)$ over a Tychonov space $X$ is $o$-bounded if and only if every continuous metrizable image $T$ of $X$ satisfies the selection…

Free groups have many applications in Algebraic Topology. In this paper I specifically study the finitely generated free groups by using the covering spaces and fundamental groups. By the Van Kampen's theorem, we have a famous fact that the…

Every hyperbolic group acts continuously on its Gromov boundary. One can form the corresponding cross-product C*-algebra A. We show that there always exists a canonical Poincare duality map from the K-theory of A to the K-homology of A. We…

In this paper we establish some foundations regarding sheaves of vector spaces on graphs and their invariants, such as homology groups and their limits. We then use these ideas to prove the Hanna Neumann Conjecture of the 1950's; in fact,…

Let $H, K$ be two finitely generated subgroups of a free group, let $\langle H, K \rangle$ denote the subgroup generated by $H, K$, called the join of $H, K$, and let neither of $H$, $K$ have finite index in $\langle H, K \rangle$. We prove…

Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…

The Surface Group Conjectures are statements about recognising surface groups among one-relator groups, using either the structure of their finite-index subgroups, or all subgroups. We resolve these conjectures in the two generator case.…

A new notion of vertex independence and rank for a finite graph G is introduced. The independence of vertices is based on the boolean independence of columns of a natural boolean matrix associated to G. Rank is the cardinality of the…

We show that for any finitely generated subgroup $H$ of a limit group $L$ there exists a finite-index subgroup $K$ containing $H$, such that $K$ is a subgroup of a group obtained from $H$ by a series of extensions of centralizers and free…

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.

For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.