ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For graphs H1H_1 and H2H_2, let r(H1,H2)r(H_1,H_2) be the least integer nn such that every red-blue edge-coloring of KnK_n contains a red copy of H1H_1 or a blue copy of H2H_2. The arboricity of a graph is the minimum number of forests into which its edge set can be partitioned. Original Burr–Erdős conjecture. For every natural number dd, there exists a constant cc such that, for every pair of graphs H1H_1 and H2H_2 each having arboricity at most dd,

r(H1,H2)≤c(∣V(H1)∣+∣V(H2)∣).r(H_1,H_2)\leq c\bigl(|V(H_1)|+|V(H_2)|\bigr).

This is the original pair-version formulation underlying the degenerate-graph perspective. The source presents it as the original conjecture and does not give a resolution here.

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.