Timeline for Local complementation group of simple graphs
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2011 at 7:02 | comment | added | P.H. | Thanks for this comment. I had seen that paper, however we haven't been able to adapt their techniques for this more restricted case. The switching allows one (along with local complementation) to span all possible graphs on v vertices. The proof in that paper relies heavily on this fact. For LC alone however one is limited to subsets of all the graphs, and as far as I known there is no efficient method of calculating the number of graphs in an LC-orbit. I suspect this is part of the reason why this problem may be difficult to answer. | |
| Feb 27, 2011 at 3:56 | history | answered | Igor Rivin | CC BY-SA 2.5 |