Timeline for Edge-coloring number of a linear hypergraph
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4, 2017 at 18:58 | comment | added | Peter Heinig | The following is obvious but maybe helpful to some: the answer is vacuously yes assuming that $H$ is a graph. Therefore, you could without loss of generality add the hypothesis that $H$ have at least one edge with more than two elements. | |
| May 3, 2017 at 11:59 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
added 4 characters in body
|
| May 3, 2017 at 8:05 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |