ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r^(G1,G2)\hat r(G_1,G_2) be the least number of edges in a graph HH such that every red-blue colouring of E(H)E(H) contains a red copy of G1G_1 or a blue copy of G2G_2. Let f(n)f(n) be the largest mm for which some nn-vertex graph GG with mm edges satisfies r^(K3,G)≤2n−1\hat r(K_3,G)≤2n-1, and let F(n)F(n) be the largest mm such that every nn-vertex graph with at most mm edges satisfies this inequality. Determine the orders of growth of f(n)f(n) and F(n)F(n). In particular, do f(n)/F(n)→∞f(n)/F(n)→∞ and F(n)/n→∞F(n)/n→∞?

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.