How does one calculate/estimate/guarantee the girth of a non-Abelian Cayley graph? This question is in reference to this other question, 
Can someone point out references (or explain!) which give techniques of being able to prove for any Cayley graph this property of having a girth logarithmic in size of the group? 

The only example like this that I can see is this argument in theorem 3.4 in this paper, http://math1.math.huji.ac.il/~alexlub/PAPERS/ramanujan%20graphs/ramanujanGraphs.pdf but this looks like an extremely specialized calculation and its not clear to me if anything here can be done in other situations. I would like to to know if there are any generic insights known! 

I am guessing that there will be a difference in the techniques depending on which of the 3 scenarios in the linked MO question is one trying to address. Given a non-Abelian group proving that (1) there exists a set of generators with this property will possibly entail a totally different proof than proving that (2) any arbitrarily picked large enough symmetric generating set or (3) a symmetric generating set picked uniformly at random has this logarithmic girth property. 
Also if someone can point out methods about finding one such symmetric generating set with this property in cases where any of the three scenarios is true! 

 A: For the Cayley graph of $SL_2(\mathbb{F}_p)$ with respect to $(1,2,0,1)$, its transpose, and their inverses (so a 4-regular graph), there is a short and elegant proof of Margulis that the girth is logarithmic; see http://link.springer.com/article/10.1007/BF02579283#page-1
The proof was reproduced in the appendix of my book with G. Davidoff and P. Sarnak. The basic tool is the fact that, in $SL_2(\mathbb{Z})$, the matrix $(1,2,0,1)$ and its transpose generate a free group on 2 generators (which is proved by a standard ping-pong argument).
A: Let's try again. For $SL(2),$ there is an argument due to Bourgain-Gamburd, which can be found in these notes of Emmanuel Breuillard. (corollary 0.2). Other gith estimates are shown in the well-known paper of Gamburd, Hoory, Shahshahani, Shalev, Virag 
MR2532876
Gamburd, A.(1-UCSC); Hoory, S.(IL-IBM); Shahshahani, M.(IR-TPM-SM); Shalev, A.(IL-HEBR-   IM); Virág, B.(3-TRNT-MS)
On the girth of random Cayley graphs. (English summary) 
Random Structures Algorithms 35 (2009), no. 1, 100–117. )

Both the results and the   techniques (to give a girth estimate) are of interest to the OP, and to others, I assume. 
