Unimodality conjecture for graphical Stirling numbers of planar graphs
Statement
Let be a planar graph of order . The graphical Stirling numbers of the first kind are the numbers for . A sequence is unimodal if there exists an index such that
Planar-graph unimodality conjecture. For any planar graph of order , the sequence is unimodal. This property is known for paths, cycles, trees, lollipop graphs, and Tadpole graphs.
The conjecture seeks a general unimodality principle for graphical Stirling numbers across planar graph families; its validity beyond the listed families remains open.
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.