Timeline for Induced Paths of Order 4
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 13, 2012 at 0:15 | comment | added | user22090 | Thanks. I was not aware of this paper. Also, it appears that an upper bound of 156/495 can be achieved using current day computers by simply checking all graphs of order 12. | |
| Mar 13, 2012 at 0:12 | vote | accept | CommunityBot | ||
| Mar 12, 2012 at 20:47 | history | answered | Sergey Norin | CC BY-SA 3.0 |