Timeline for Smallest odd cycle in a non-bipartite graph
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2019 at 6:34 | comment | added | Ilya Bogdanov | Right! I've added a picture. | |
| Apr 11, 2019 at 6:33 | history | edited | Ilya Bogdanov | CC BY-SA 4.0 |
Picture added
|
| Apr 11, 2019 at 6:13 | comment | added | Victor Protsak | Thank you, Ilya. So you blow up a set of vertices and A and B are adjacent in the blown up graph iff their images are adjacent in the original graph. | |
| Apr 11, 2019 at 5:55 | comment | added | Ilya Bogdanov | Each duplicate is connected to all vertices the origin was connected to, as well as to their duplicates. Thus, the degree of each duplicated vertex's neighbor increases. I'll try to make a picture later | |
| Apr 11, 2019 at 5:41 | comment | added | Victor Protsak | I was having a hard time understanding this construction. What is the effect of "duplicating the vertices" on the edges of the graph? A picture or an easy example would help. | |
| Apr 10, 2019 at 21:55 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |