Timeline for Generating graphs of groups
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 25, 2019 at 0:00 | comment | added | verret | When you crosspost, you should acknowledge it: math.stackexchange.com/questions/3397187/… | |
| Nov 24, 2019 at 17:55 | comment | added | Sam Zbarsky | I believe your formula for $S$ should say $(v,u)\notin E$. You can eke out some minor improvement as follows: if you have an independent set, you can cover all the missing edges in that set with one prime. Thus (switching from independent sets to cliques), you need to know the maximum number of cliques needed to cover the edges a graph on $n$ vertices. That is less than $n(n-1)/2$, but at best by a constant factor (as the example $K_{n/2,n/2}$ shows). | |
| Nov 24, 2019 at 17:24 | history | asked | Chain Markov | CC BY-SA 4.0 |