ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree, let Δ\Delta and kk be positive integers, and let HH be a graph with chromatic number χ(H)=k\chi(H)=k. A graph TT is HH-good if its Ramsey number with HH satisfies r(T,H)=∣T∣+∣H∣−2r(T,H)=|T|+|H|-2. Bounded-degree tree Ramsey goodness conjecture. For all Δ\Delta and kk there exists a constant CΔ,kC_{\Delta,k} such that, for any tree TT with maximum degree at most Δ\Delta and any graph HH with χ(H)=k\chi(H)=k satisfying

∣T∣≥CΔ,k∣H∣,|T|\geq C_{\Delta,k}|H|,

TT is HH-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.