Monotonicity conjecture for restricted graphical Stirling numbers
Statement
Let be a graph, let be fixed, and let denote the -restricted graphical Stirling number, where the restricted-set size is indexed by . Restricted-number monotonicity conjecture. For any graph and fixed , the restricted graphical Stirling numbers satisfy
Equivalently, the sequence decreases strictly as the size of the restricted set increases.
The conjecture proposes monotonicity for every graph and fixed ; no supporting cases or resolution are supplied in the source.
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.