ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An edge-ordered graph is a graph whose edges are equipped with a linear ordering. A graph is dd-degenerate if every induced subgraph has a vertex of degree at most dd. For an edge-ordered graph HH, let redge⁡(H)r_{\operatorname{edge}}(H) be its edge-ordered Ramsey number, and let nn denote the number of vertices of HH. Lower-bound conjecture. For every d≥1d\geq 1, there exists an infinite family of edge-ordered dd-degenerate graphs HH such that

redge⁡(H)≥nΩ(d).r_{\operatorname{edge}}(H)\geq n^{\Omega(d)}.

The authors conjecture that such examples exist because they cannot rule out the stronger linear bound, and that this lower bound would make the polynomial upper bound tight up to the constant in the exponent. 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 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.