Related papers: Density of quotient orders in groups and applicati…

In this paper, we show that the natural density (among the positive integers) of the set of orders of the finite quotients of any ordinary triangle group is zero. This is achieved using methods inspired by a 1976 theorem of Bertram on large…

This papers focuses on the average order of dominating sets of a graph. We find the extremal graphs for the maximum and minimum value over all graphs on $n$ vertices, while for trees we prove that the star minimizes the average order of…

We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities.…

Reiher, R\"odl, Sales, and Schacht initiated the study of relative Tur\'an densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For an ordered graph $F$, its relative Tur\'an density,…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

For an ordered graph $F$, denote the Tur\'an density by $\vec{\pi}(F)$. The relative Tur\'an density, denoted by $\rho(F)$, is the supremum over $\alpha \in [0,1]$ such that every ordered graph $G$ contains an $F$-free subgraph $G'$ with…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Let $o(G)$ be the average of the element orders of a finite group $G$. A research topic concerning this quantity is understanding the relation between $o(G)$ and $o(H)$, where $H$ is a subgroup of $G$. Let $\mathcal{N}$ be the class of…

We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…

We introduce a density model for random quotients of a free product of finitely generated groups. We prove that a random quotient in this model has the following properties with overwhelming probability: if the density is below $1/2$, the…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

If a graph $G$ has distinguishing number 2, then there exists a partition of its vertex set into two parts, such that no nontrivial automorphism of $G$ fixes setwise the two parts. Such a partition is called a 2-distinguishing coloring of…

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…