Polynomial-exponent upper-bound conjecture for linear hypergraph Ramsey numbers
Statement
A -graph is linear if any two of its edges share at most one vertex. For fixed , let be the least such that every red-blue coloring of contains a red copy of or a blue copy of . Polynomial-exponent upper-bound conjecture. There is an absolute constant such that, for every fixed linear -graph ,
The source records this as a proposed uniform upper bound. It follows stronger bounds for linear from existing methods, but does not establish an absolute exponent valid for every fixed linear -graph.
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.