The trivial lower bound for the girth of S_n
classification
🧮 math.GR
math.CO
keywords
girthgraphomegaboundcayleyconjecturallyconsiderelements
read the original abstract
Consider the Cayley graph of $S_n$ generated by a random pair of elements $x,y$. Conjecturally, the girth of this graph is $\Omega(n \log n)$ with probability tending to $1$ as $n\to\infty$. We show that it is at least $\Omega(n^{1/3})$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.