Skip to main content
2 events
when toggle format what by license comment
Jan 3, 2014 at 18:44 comment added Mohammad Al-Turkistany Can you simplify the formula for the number of symmetric graphs and give tight asymptotic upper-bound? (such as $o(f(|V|))$)
Apr 22, 2013 at 2:43 history answered Douglas Zare CC BY-SA 3.0