The forbidden-isometric-subgraph characterization of half-hyperbolic 6-chordal graphs
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 for 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 -chordal graph is -hyperbolic if and only if it does not contain any of the ten special graphs , , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.