ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a fixed graph and let Gn{G_n} be a sequence of graphs. For vertices v,wv,w of GnG_n, write w=(v,w)∈V(Gn)2{\mathbf{w}}=(v,w)\in V(G_n)_2 for a pair of vertices, and call such a pair influential when it has the influential-pair property considered in the paper. Let Z(H,Gn)Z(H,G_n) denote the normalized monochromatic HH-count.

Influential-pair obstruction conjecture. If for every NN there is some n>Nn>N such that GnG_n has an influential pair of vertices w=(v,w)∈V(Gn)2{\mathbf{w}}=(v,w)\in V(G_n)_2, then

Z(H,Gn)\centernot→in lawN(0,1).Z(H,G_n)\centernot{\xrightarrow{\text{in law}}}\mathscr{N}(0,1).

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 HH.

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.