The influential-pair obstruction conjecture for monochromatic subgraph counts
Statement
Let be a fixed graph and let be a sequence of graphs. For vertices of , write for a pair of vertices, and call such a pair influential when it has the influential-pair property considered in the paper. Let denote the normalized monochromatic -count.
Influential-pair obstruction conjecture. If for every there is some such that has an influential pair of vertices , then
This proposes that influential pairs prevent convergence in law to the standard normal distribution for general monochromatic subgraph counts. The paper proves a sufficiency result under the absence of influential pairs, while the corresponding necessity statement is conjectured because the quadratic-polynomial argument available for triangles does not directly extend to general graphs .
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.