Timeline for Deleting triangles in a graph
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 22 at 3:30 | comment | added | Brendan McKay | @HaukeReddmann There may be no edges in a single triangle, so "only destroy one triangle at a time" might be impossible. | |
S Jul 22 at 1:18 | history | suggested | Artem Kaznatcheev | CC BY-SA 4.0 |
added link to wikipedia article on Tuza's conjecture, for those (like me) looking for more!
|
Jul 21 at 20:59 | review | Suggested edits | |||
S Jul 22 at 1:18 | |||||
Sep 23, 2021 at 0:59 | history | bounty ended | Isky Mathews | ||
Sep 16, 2021 at 18:33 | comment | added | Hauke Reddmann | Given it's in NP (bummer!), this is probably the most extensive answer to get. THX. (Obviously, an additional "do only destroy one triangle per time" will make things even more complicated...or so I guess.) | |
Sep 16, 2021 at 18:30 | vote | accept | Hauke Reddmann | ||
Sep 15, 2021 at 23:49 | history | answered | Tony Huynh | CC BY-SA 4.0 |