ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A line grid graph is a graph obtained as the line graph of a grid graph. A graph is 1212-representable if there is a word over its vertices in which every pair of distinct vertices occurs alternately exactly twelve times. Let FF denote the family of forbidden graphs established earlier in the paper, and set

P:=F∪{B(3,3,3),G3,G4,G5,G6}.P:=F\cup\{B(3,3,3),G_3,G_4,G_5,G_6\}.

The graphs B(3,3,3)B(3,3,3) and GiG_i for i∈{3,4,5,6}i\in\{3,4,5,6\} are the graphs shown in the paper's Figures~ and~, respectively. The forbidden-subgraph conjecture. A line grid graph is 1212-representable if and only if it is PP-avoiding, meaning that it contains no graph from PP as an induced subgraph. This would give a finite forbidden-induced-subgraph characterization of 1212-representability for line grid graphs, extending the non-1212-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 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.