ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every connected bipartite graph GG with nn vertices and every chosen vertex v∈V(G)v\in V(G), let FGF_G be uniformly distributed over the finite set {f:V(G)→Z:f(v)=0 and ∣f(x)−f(y)∣=1 for every xy∈E(G)}\{f:V(G)\to\mathbb{Z}: f(v)=0\text{ and }|f(x)-f(y)|=1\text{ for every }xy\in E(G)\}. Define the range by Range⁡(f)=max⁡x∈V(G)f(x)−min⁡x∈V(G)f(x)\operatorname{Range}(f)=\max_{x\in V(G)}f(x)-\min_{x\in V(G)}f(x). Then the conjecture asserts that

E[Range⁡(FG)]≤E[Range⁡(FPn)],\mathbb{E}\bigl[\operatorname{Range}(F_G)\bigr]\leq \mathbb{E}\bigl[\operatorname{Range}(F_{P_n})\bigr],

where PnP_n is the path on nn vertices and FPnF_{P_n} is defined analogously, with any one vertex pinned at 00.

Record

Added
Links

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.