Given integers $k,l\geq 2$, where either $l$ is odd or $k$ is even, let $n(k,l)$ denote the largest integer $n$ such that each element of $A_n$ is a product of $k$ many $l$-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev proved that if $k,l$ both are odd, $3\mid l$ and $l>3$, then $n(k,l)=\frac{2}{3}kl$. They further conjectured that if $k$ is even and $3\mid l$, then $n(k,l)=\frac{2}{3}kl+1$. In this article, we prove this conjecture. We also prove that $n(k,3)=2k+1$ if $k$ is odd
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
For two given graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer n such that for...
The thesis presents four main theorems on cyclic tournaments. The first deals with the problem of de...
AbstractGiven integers k,l⩾2, where either l is odd or k is even, we denote by n=n(k,l) the largest ...
Denote by R(L,L,L) the minimum integer N such that any 3-coloring of the edges of the complete graph...
For a graph L and an integer k≥2, Rk(L) denotes the smallest integer N for which for any edge-colori...
summary:For a finite group $G$ denote by $N(G)$ the set of conjugacy class sizes of $G$. In 1980s, J...
For an odd integer k, let Ck={C3,C5,…,Ck}Ck={C3,C5,…,Ck} denote the family of all odd cycles of leng...
For graphs L1, . . . ,Lk, the Ramsey number R(L1, . . . ,Lk) is the minimum integer N satisfying tha...
AbstractWe show how to obtain maximum packings of K2kg+v with k-cycles when k⩾3 is odd, g a positive...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contain...
In 1981, Erdős and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a gra...
summary:Let $G$ be a finite group, and let $N(G)$ be the set of conjugacy class sizes of $G$. By Tho...
In 1981, Erd\H{o}s and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
For two given graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer n such that for...
The thesis presents four main theorems on cyclic tournaments. The first deals with the problem of de...
AbstractGiven integers k,l⩾2, where either l is odd or k is even, we denote by n=n(k,l) the largest ...
Denote by R(L,L,L) the minimum integer N such that any 3-coloring of the edges of the complete graph...
For a graph L and an integer k≥2, Rk(L) denotes the smallest integer N for which for any edge-colori...
summary:For a finite group $G$ denote by $N(G)$ the set of conjugacy class sizes of $G$. In 1980s, J...
For an odd integer k, let Ck={C3,C5,…,Ck}Ck={C3,C5,…,Ck} denote the family of all odd cycles of leng...
For graphs L1, . . . ,Lk, the Ramsey number R(L1, . . . ,Lk) is the minimum integer N satisfying tha...
AbstractWe show how to obtain maximum packings of K2kg+v with k-cycles when k⩾3 is odd, g a positive...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contain...
In 1981, Erdős and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a gra...
summary:Let $G$ be a finite group, and let $N(G)$ be the set of conjugacy class sizes of $G$. By Tho...
In 1981, Erd\H{o}s and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
For two given graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer n such that for...
The thesis presents four main theorems on cyclic tournaments. The first deals with the problem of de...