Timeline for Is there a version of Robertson-Seymour's graph minor theorem known to apply to signed graphs?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2016 at 9:45 | history | edited | user31016 | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Jan 5, 2016 at 9:42 | comment | added | user31016 | Exactly. @Tony, many thanks for your clarifications and answer. | |
| Jan 4, 2016 at 8:20 | comment | added | Tony Huynh | @Victor Protsak: by cutset, user31016 means to take a subset $X$ of the vertices and to take all edges with exactly one endpoint in $X$ (this set of edges is usually called $\delta(X)$). | |
| Jan 4, 2016 at 8:03 | comment | added | Victor Protsak | "Clearly this does not change sign of any cycle" --- what about the sign of a 3-cycle $ABC$ after flipping the signs of the edges in the cutset of the set $\{A,B,C\}$? If you flip the signs of all 3 edges in this cycle, the sign would change. | |
| Jan 4, 2016 at 5:54 | history | edited | Tony Huynh | CC BY-SA 3.0 |
expanded on definition of minors for signed graphs and added some tags.
|
| Jan 3, 2016 at 13:34 | vote | accept | user31016 | ||
| Jan 3, 2016 at 8:39 | answer | added | Tony Huynh | timeline score: 11 | |
| Jan 2, 2016 at 19:56 | history | asked | user31016 | CC BY-SA 3.0 |