ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture: (Burr--Erd\H{o}s) r(G,G)≤c(d)nr(G,G) \le c(d) n if GG is an nn-vertex dd-degenerate graph.

Known: (Kostochka--Sudakov) r(G,G)≤n1+od(1)r(G,G) \le n^{1+o_d(1)}.

If GG is a 3-uniform dd-degenerate hypergraph, the statement can be false. There is a 1-degenerate 4-uniform GG such that r4(G,G)≥2Ω(n1/3)r_4(G,G) \ge 2^{\Omega(n^{1/3})}.

Perhaps we can redefine degeneracy for kk-uniform hypergraphs: call a kk-uniform hypergraph dd-degenerate if the 2-graph obtained by replacing every edge by a graph clique Kk(2)K_k^{(2)} is dd-degenerate as a graph.

Record

Added
Links

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.