Timeline for Local complementation in undirected graphs
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3, 2010 at 6:53 | history | edited | domotorp | CC BY-SA 2.5 |
added warning
|
| Mar 2, 2010 at 23:37 | vote | accept | Anthony Labarre | ||
| Mar 2, 2010 at 23:37 | comment | added | Anthony Labarre | Indeed, thanks for settling that issue. Since I was trying to rely on that to find a proof of something else, I might be asking a similar question soon. | |
| Mar 2, 2010 at 21:48 | history | edited | domotorp | CC BY-SA 2.5 |
added parity; added 2 characters in body
|
| Mar 2, 2010 at 21:43 | comment | added | domotorp | Hey, I just realized that what you ask is impossible! I will append the proof to my answer. | |
| Mar 2, 2010 at 21:40 | comment | added | domotorp | In fact now I realized that nothing follows from this proof to your conjecture. Could you give me an example where the degrees satisfy your parity conditions and can be deleted? I guess you can just edit your original question and add this to the questions section. Or if you want more people to notice it, then it makes more sense to ask a new question, maybe also pointing to this question. | |
| Mar 2, 2010 at 19:36 | comment | added | Anthony Labarre | Thanks for the time you've taken to sketch this, I'm not sure I got everything but I guess going through it some more should get me there. I still wonder however if the conjecture we discussed above (with the parity condition) can be proved either way or if I should give up hope because of your proof. I'm still new to this website, so I don't know if I should start a new thread to ask that or just append the conjecture to my first message. | |
| Feb 28, 2010 at 9:46 | history | answered | domotorp | CC BY-SA 2.5 |