Related papers: Optimal Farey sequence for the Congruence subgroup…

Let $\alpha'$ and $\mu_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this paper, we prove a tight lower bound $$\alpha' \ge…

Given a finite Abelian group $G$ and a generator subset $A\subset G$ of cardinality two, we consider the Cayley digraph $\Gamma=$Cay$(G,A)$. This digraph is called $2$--Cayley digraph. An extension of $\Gamma$ is a $2$--Cayley digraph,…

A folklore result attributed to P\'olya states that there are $(1 + o(1))2^{\binom{n}{2}}/n!$ non-isomorphic graphs on $n$ vertices. Given two graphs $G$ and $H$, we say that $G$ is a unique subgraph of $H$ if $H$ contains exactly one…

Let $g\geq3$ and $n\geq0$, and let ${\mathcal{M}}_{g,n}$ be the mapping class group of a surface of genus $g$ with $n$ boundary components. We prove that ${\mathcal{M}}_{g,n}$ contains a unique subgroup of index $2^{g-1}(2^{g}-1)$ up to…

Tibor Gallai conjectured that the edge set of every connected graph $G$ on $n$ vertices can be partitioned into $\lceil n/2\rceil$ paths. Let $\mathcal{G}_{k}$ be the class of all $2k$-regular graphs of girth at least $2k-2$ that admit a…

A simple graph $G$ is an {\it 2-tree} if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is an 2-tree. Clearly, if $G$ is an 2-tree on $n$ vertices, then $|E(G)|=2n-3$. A non-increasing sequence…

We show that any connected Cayley graph $\Gamma$ on an Abelian group of order $2n$ and degree $\tilde{\Omega}(\log n)$ has at most $2^{n+1}(1 + o(1))$ independent sets. This bound is tight up to to the $o(1)$ term when $\Gamma$ is…

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

The spacing distribution between Farey points has drawn attention in recent years. It was found that the gaps $\gamma_{j+1}-\gamma_j$ between consecutive elements of the Farey sequence produce, as $Q\to\infty$, a limiting measure. Numerical…

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

Finite index subgroups of the modular group are of great arithmetic importance. Farey symbols, introduced by Ravi Kulkarni in 1991, are a tool for working with these groups. Given such a group $\Gamma$, a Farey symbol for $\Gamma$ is a…

We show that for a typical high rank arithmetic lattice $\Gamma$, there exist finite index subgroups $\Gamma_{1}$ and $\Gamma_{2}$ such that $\Gamma_{1} \not\simeq \Gamma_{2}$ while $\widehat{\Gamma_{1}} \simeq \widehat{\Gamma_{2}}$. But…

Denote by $\Gamma$ the set of pointwise good sequences. Those are sequences of real numbers $(a_k)$ such that for any measure preserving flow $(U_t)_{t\in \mathbb R}$ on a probability space and for any $f\in L^\infty$, the averages…

Let $\{u_n\}_{n=1}^{\infty}$ be the Sylvester's sequence (sequence A000058 in the OEIS), and let $ a_1 < a_2 < \cdots $ be any other positive integer sequence satisfying $ \sum_{i=1}^\infty \frac{1}{a_i} = 1 $. In this paper, we solve a…

We study the connection between the degree sequence of a $k$-uniform hypergraph and the size of its largest matching. Let $\mathcal{F}$ be a $k$-uniform hypergraph on $n$ vertices and let $d_1 \ge d_2 \ge \dots \ge d_n$ be the vertex…

Let $\Gamma_+$ be a normal subgroup of index $2n$ of a group $\Gamma$ and $\gamma_i \in \Gamma \setminus \Gamma_+$ be involutions. We first prove that if $\Gamma = \Gamma_+ \rtimes (\mathbb{Z}_2(\gamma_1) \times \cdots \times…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…