Timeline for Algorithm for 2-coloring classes of 3-uniform hypergraphs
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9, 2015 at 8:00 | answer | added | Florent Foucaud | timeline score: 1 | |
| Oct 9, 2015 at 7:51 | comment | added | Florent Foucaud | you should rather post on cstheory.stackexchange.com | |
| Aug 29, 2015 at 10:02 | comment | added | user78647 | By "coloring" I mean a coloring of the vertices such that there is no monochromatic edge. | |
| Aug 29, 2015 at 9:55 | comment | added | Brendan McKay | Please define 2-colouring for hypergraphs. There are many definitions around. | |
| Aug 29, 2015 at 8:42 | review | First posts | |||
| Aug 29, 2015 at 8:55 | |||||
| Aug 29, 2015 at 8:42 | history | asked | user78647 | CC BY-SA 3.0 |