ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a graph be 6-chordal if every cycle of length at least six has a chord, and let graph hyperbolicity be measured in the usual graph metric. Let G1,G2,G3,C4,C6,HiG_1,G_2,G_3,C_4,C_6,H_i for i=1,…,5i=1,\ldots,5 be the ten special graphs depicted or defined in the paper. An isometric subgraph is a subgraph whose induced distances agree with the distances in the ambient graph.

Forbidden-subgraph conjecture. A 66-chordal graph is 12\frac{1}{2}-hyperbolic if and only if it does not contain any of the ten special graphs G1,G2,G3,C4,C6,HiG_1,G_2,G_3,C_4,C_6,H_i, i=1,…,5i=1,\ldots,5, as an isometric subgraph.

The claim gives a finite forbidden-isometric-subgraph characterization of half-hyperbolic graphs within the class of 6-chordal graphs. The supplied source context does not indicate whether this conjecture has been proved or disproved.

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.