The forbidden-subgraph characterization of 12-representable line grid graphs
Statement
A line grid graph is a graph obtained as the line graph of a grid graph. A graph is -representable if there is a word over its vertices in which every pair of distinct vertices occurs alternately exactly twelve times. Let denote the family of forbidden graphs established earlier in the paper, and set
The graphs and for are the graphs shown in the paper's Figures~ and~, respectively. The forbidden-subgraph conjecture. A line grid graph is -representable if and only if it is -avoiding, meaning that it contains no graph from as an induced subgraph. This would give a finite forbidden-induced-subgraph characterization of -representability for line grid graphs, extending the non--representability results proved in the paper for the listed obstructions. The conjecture's resolution is not supplied here.
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.