ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let kk be fixed, and let \stGkr\st{G}{k}_r denote the rr-restricted graphical Stirling number, where the restricted-set size is indexed by rr. Restricted-number monotonicity conjecture. For any graph GG and fixed kk, the restricted graphical Stirling numbers satisfy

\stGk1≥\stGk2≥⋯≥\stGkk.\st{G}{k}_1\geq\st{G}{k}_2\geq\dots\geq\st{G}{k}_k.

Equivalently, the sequence decreases strictly as the size of the restricted set increases.

The conjecture proposes monotonicity for every graph and fixed kk; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.