The bounded-degree tree Ramsey goodness conjecture
Statement
Let be a tree, let and be positive integers, and let be a graph with chromatic number . A graph is -good if its Ramsey number with satisfies . Bounded-degree tree Ramsey goodness conjecture. For all and there exists a constant such that, for any tree with maximum degree at most and any graph with satisfying
is -good. The paper establishes the corresponding range up to logarithmic factors; the conjecture asserts that these factors can be removed.
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.