Eventual Turán-goodness conjecture for every graph
Statement
Let be any graph. For a positive integer , say that is -Turán-good if the relevant Turán graph is extremal for copies of in every sufficiently large graph subject to the corresponding -chromatic forbidden-subgraph condition. Eventual Turán-goodness conjecture. For every graph , there is an integer such that, whenever , the graph is -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 .
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.