Return to Revisions

2 of 2

added 23 characters in body

edited Jun 9, 2015 at 21:48

53
4

Is it true that any $3$-uniform hypergraph that is not $k$-colorable must have $\Omega(k^3)$ edges?

What is the best lower bound in terms of $k$ on the number of edges in a $3$-uniform hypergraph that is not $k$-colorable?

Thanks in advance.

co.combinatorics graph-theory graph-colorings hypergraph

asked Jun 9, 2015 at 20:30

53
4