ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be any graph. For a positive integer kk, say that HH is kk-Turán-good if the relevant Turán graph Tk−1(n)T_{k-1}(n) is extremal for copies of HH in every sufficiently large graph subject to the corresponding kk-chromatic forbidden-subgraph condition. Eventual Turán-goodness conjecture. For every graph HH, there is an integer k0k_0 such that, whenever k≥k0k\geq k_0, the graph HH is kk-Turán-good. The conjecture is known for complete multipartite graphs, while the general case remains open; the paper also notes that the analogous assertion need not hold for small kk.

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.