Chen–Yang–Yuan–Zhang conjecture for generalized Turán numbers of linear paths
Statement
For integers , , and , let be the graph construction defined above, and for write
Let denote the maximum number of copies of in an -vertex graph containing no vertex-disjoint copies of the path .
Chen–Yang–Yuan–Zhang conjecture. For and ,
Moreover, if , then every extremal graph satisfies either
or
This generalizes the known exact edge-counting result for -packings to clique counts. The conjecture compares the two constructions that are extremal when ; the asserted characterization further restricts all extremal graphs for .
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.