Timeline for Finding a cycle of fixed length
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2016 at 12:06 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 86 characters in body
|
| Feb 23, 2011 at 1:40 | history | edited | Tony Huynh | CC BY-SA 2.5 |
deleted 20 characters in body
|
| Feb 26, 2010 at 15:51 | comment | added | Tony Huynh | If we consider graphs with edges labelled from a finite abelian group, then we can define the group-value of a cycle as the sum of its edge labels. For a fixed element g of the group, we can then ask if there is cycle with group-value g. Cycles of length 0 (mod k) are a special instance of this problem, where the group is $Z_k$, g=0, and all edge labels are 1. | |
| Feb 26, 2010 at 7:25 | comment | added | Hsien-Chih Chang 張顯之 | Finding a cycle of length being a multiple of k is a pretty interesting question. Thanks for the information! | |
| Feb 25, 2010 at 21:41 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 12 characters in body
|
| Feb 25, 2010 at 21:22 | comment | added | David Eppstein | A polynomial bound for general graphs (for any fixed k) is given by the Alon et al color-coding paper that the original question cites. | |
| Feb 25, 2010 at 19:47 | history | answered | Tony Huynh | CC BY-SA 2.5 |