For every fixed k-graph F, does there exist a constant c_{F} depending only on F such that every F-free k-uniform hypergraph with maximum degree \Delta has chromatic number at…
Statement
For every fixed k-graph F, does there exist a constant c_{F} depending only on F such that every F-free k-uniform hypergraph with maximum degree \Delta has chromatic number at most c_{F}(\Delta/\log\Delta)^{1/(k-1)}?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.