ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on vertex set {v1,…,vn}\{v_1,\dots,v_n\}, and let G[H1,…,Hn]G[H_1,\dots,H_n] denote the graph obtained by replacing each vertex viv_i with a graph HiH_i and adding all edges prescribed by the edges of GG. A graph is betweenness-uniform when all its vertices have the same betweenness.

Coroničová Hurajová–Gago–Madaras conjecture. For any graph GG on a vertex set {v1,…,vn}\{v_1,\dots,v_n\} there exist graphs H1,…,HnH_1,\dots,H_n such that G[H1,…,Hn]G[H_1,\dots,H_n] is betweenness-uniform.

The conjecture proposes that every graph admits a suitable blow-up yielding a betweenness-uniform graph. The supplied text does not state whether it has been resolved.

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.