ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph of order nn. The graphical Stirling numbers of the first kind are the numbers \stGk\st{G}{k} for 1≤k≤n1\leq k\leq n. A sequence is unimodal if there exists an index k0k_0 such that

\stG1≤⋯≤\stGk0≥⋯≥\stGn.\st{G}{1} \leq \cdots \leq \st{G}{k_0} \geq \cdots \geq \st{G}{n}.

Planar-graph unimodality conjecture. For any planar graph GG of order nn, the sequence {\stGk}k=1n\{\st{G}{k}\}_{k=1}^n 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 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.