Original Burr–Erdős conjecture for pairs of bounded-arboricity graphs
Statement
For graphs and , let be the least integer such that every red-blue edge-coloring of contains a red copy of or a blue copy of . 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 , there exists a constant such that, for every pair of graphs and each having arboricity at most ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.