Related papers: The minimal genus problem for right angled Artin g…
The packing problem and the covering problem are two of the most general questions in graph theory. The Erd\H{o}s-P\'{o}sa property characterizes the cases when the optimal solutions of these two problems are bounded by functions of each…
In "Subgroups of Graph Groups", 1987, J. Alg., Droms proved that all the subgroups of a right-angled Artin group (RAAG) defined by a finite simplicial graph $\Gamma$ are themselves RAAGs if, and only if, $\Gamma$ has no induced square graph…
There is a procedure, due to Dani and Levcovitz, for taking a finite simplicial graph (\Gamma) and a subgraph (\Lambda) of its complement, checking some conditions, and, if satisfied, producing a graph (\Delta) such that the right-angled…
Any finite simple graph $G = (V,E)$ can be represented by a collection $\mathscr{C}$ of subsets of $V$ such that $uv\in E$ if and only if $u$ and $v$ appear together in an odd number of sets in $\mathscr{C}$. Let $c_2(G)$ denote the minimum…
A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the…
In this paper, we obtain a lower bound for the smallest eigenvalue of a regular graph containing many copies of a smaller fixed subgraph. This generalizes a result of Aharoni, Alon, and Berger in which the subgraph is a triangle. We apply…
This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph $G$, which Eulerian orientation minimizes or maximizes the number of arborescences? We solve the minimization for the complete graph…
This paper is the first part of a series of papers aimed at improving the classification by Formanek of the irreducible representations of Artin braid groups of small dimension. In this paper we classify all the irreducible complex…
Erd\H{o}s and Simonovits asked the following question: For an integer $r\geq 2$ and a family of non-bipartite graphs $\mathcal{H}$, determine the infimum of $\alpha$ such that any $\mathcal{H}$-free $n$-vertex graph with minimum degree at…
A (k, g) graph is a graph with regular degree k and girth g. The cage problem refers to finding the smallest (k, g) graph. The (3, 14) cage problem is known to be unresolved. In 2002, Exoo found a (3, 14) record graph with order 384. The…
Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…
We prove that rational homology of the Torelli group of genus g is infinite dimensional, provided g>6. This means that rational homology of the Torelli space of genus g>6 is infinite dimensional. The Torelli groups with marked points are…
We study the minimal genus problem for some smooth four-manifolds.
We investigate the $G$-representation varieties of right-angled Artin groups (RAAGs) for various Lie groups $G$. We show these varieties are connected for a large class of such $G$, including $\mathrm{SU}(n), \mathrm{Sp}(n)$ and…
In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…
The \emph{genus} $\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$. A drawing of a graph on a surface is \emph{independently even} if every pair of nonadjacent…
In the $(2,5)$ minimal model, the partition function for genus $g=2$ Riemann surfaces is given by a $5$-tuple of functions with appropriate transformation under the mapping class group. These functions generalise the two Rogers-Ramanujan…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…