F-free hypergraph coloring conjecture
Statement
Let be a -graph. A -graph is -free if it contains no copy of . Let denote the maximum degree. F-free coloring conjecture. There is a constant depending only on such that every -free -graph with maximum degree has chromatic number at most
This conjecture, posed in the earlier paper cited as [FM], proposes replacing the hypothesis of simplicity by the weaker hypothesis of being -free; the source does not state a resolution.
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.