Middle-level node-width conjecture for divisor Hasse diagrams
Statement
Let be the Hasse diagram associated with the divisors of , let denote its vertices at level , and let denote the node width. Node width at middle level. The node width should equal the number of vertices at the middle level:
The source lists this among intriguing conjectures posed as open problems about graph invariants of divisor Hasse diagrams.
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.