Timeline for Maximum number of four cycles with no intersecting three vertex paths
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jun 11, 2020 at 13:54 | history | suggested | Balagopal Komarath | CC BY-SA 4.0 |
The graph may contain two $C_4$s that intersect at a $P_3$. Only the set of cycles chosen need to not have a common $P_3$.
|
| Jun 11, 2020 at 13:14 | review | Suggested edits | |||
| S Jun 11, 2020 at 13:54 | |||||
| Jun 7, 2020 at 20:34 | answer | added | Adam P. Goucher | timeline score: 1 | |
| Jun 7, 2020 at 10:05 | review | First posts | |||
| Jun 7, 2020 at 10:33 | |||||
| Jun 7, 2020 at 10:01 | history | asked | Balagopal Komarath | CC BY-SA 4.0 |