The polylogarithmic conjecture for edge-ordered forests
Statement
An edge-ordered graph is a finite simple graph equipped with a linear order on its edges; its extremal function is the maximum number of edges in an -vertex edge-ordered graph avoiding . Edge-ordered forest conjecture. For every edge-ordered forest of order chromatic number ,
The paper proves the weaker bound , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.