Doubling conjecture for dimension-banned graphs
Statement
Let a graph be banned in dimension when it has no orthogonal representation in dimension . If a vertex of valence in a graph banned in dimension is doubled, then the doubling conjecture. the resulting graph is banned in dimension . The paper presents this as a recursive construction of banned graphs; no proof or resolution is supplied.
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.