For the rotational dimension dimrot and the Colin de Verdière number μ, conjecture that dimrot(G) ≤ μ(G) for every graph G; also conjecture dimrot(G₁ ∪ G₂) ≤ max{dimrot(G₁),…
Statement
For the rotational dimension dimrot and the Colin de Verdière number μ, conjecture that dimrot(G) ≤ μ(G) for every graph G; also conjecture dimrot(G₁ ∪ G₂) ≤ max{dimrot(G₁), dimrot(G₂), |G₁ ∩ G₂| + 1} when G₁ ∩ G₂ is complete, and dimrot(G) ≤ 3 if and only if G has no K₅-minor.
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.