Timeline for How does one calculate/estimate/guarantee the girth of a non-Abelian Cayley graph?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2015 at 0:14 | comment | added | user6818 | (3) And what is the standard ping-pong argument? Could you kindly reference it? | |
| Apr 29, 2015 at 0:10 | comment | added | user6818 | Let me combine here a few questions here stemming from your comments. Firstly the only implication I know of this kind is that an expander has girth at most logarithmic in the graph size. (1) If one wants to show that a certain graph is not an expander then one has to show that the girth is somehow "very high". But what exactly does one need to show about the girth to guarantee non-expansion? I am not seeing a very precise statement. (2) Isn't that solvability argument an upper bound on the girth? So that can't prove or disprove something being an expander - right? | |
| Apr 27, 2015 at 20:08 | history | answered | Alain Valette | CC BY-SA 3.0 |