Polynomial bound conjecture for edge-ordered Ramsey numbers of degenerate graphs
Statement
An edge-ordered graph is a graph whose edges are equipped with a linear ordering. A graph is -degenerate if every induced subgraph has a vertex of degree at most . For an edge-ordered graph , let be its edge-ordered Ramsey number. Polynomial bound conjecture. If is an edge-ordered -degenerate graph on vertices, then
This would improve the paper's existing bound for edge-ordered Ramsey numbers of sparse graphs. The stronger linear analogue is also left unresolved, so this conjecture remains open.
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.