ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An edge-ordered graph is a finite simple graph equipped with a linear order on its edges; its extremal function ex<(n,H){\mathrm{ex}}_<(n,H) is the maximum number of edges in an nn-vertex edge-ordered graph avoiding HH. Edge-ordered forest conjecture. For every edge-ordered forest HH of order chromatic number 22,

ex<(n,H)=nlog⁡O(1)n.{\mathrm{ex}}_<(n,H)=n\log^{O(1)}n.

The paper proves the weaker bound ex<(n,H)=n2O(log⁡n){\mathrm{ex}}_<(n,H)=n2^{O(\sqrt{\log n})}, so improving it to a polylogarithmic factor is the main open problem identified by the authors.

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.