Timeline for Is it true that any $3$-uniform hypergraph that is not $k$-colorable must have $\Omega(k^3)$ edges?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2015 at 5:54 | vote | accept | TCS-user-23 | ||
| Jun 9, 2015 at 22:23 | answer | added | Thomas Bloom | timeline score: 7 | |
| Jun 9, 2015 at 22:14 | comment | added | Thomas Bloom | If the $m(k)$ denotes the minimum number of edges of a 3-uniform hypergraph not $k$-colourable, then a straightforward application of the probabilistic method gives $k^2\ll m(k) \ll k^5$, I believe. | |
| Jun 9, 2015 at 21:48 | history | edited | TCS-user-23 | CC BY-SA 3.0 |
added 23 characters in body
|
| Jun 9, 2015 at 20:34 | review | First posts | |||
| Jun 9, 2015 at 21:24 | |||||
| Jun 9, 2015 at 20:30 | history | asked | TCS-user-23 | CC BY-SA 3.0 |