The general off-diagonal unordered Erdős–Rado bound
Statement
For integers , let denote the off-diagonal unordered Erdős–Rado number for monochromatic and lexical cliques of the indicated orders against a rainbow clique of order . The general off-diagonal Erdős–Rado conjecture. For every , there exists a constant such that, for every ,
The paper establishes the correct asymptotics in several boundary cases, including and , but leaves a gap for general ; the conjecture asserts that the known lower-bound order is sharp.
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.