ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GnG_n be an io-decomposable Riordan graph of the Bell type. The Pascal and Catalan graphs are

PGn=Gn(1/(1−z),z/(1−z)),CGn=Gn(C(z),zC(z)).PG_n=G_n(1/(1-z),z/(1-z)),\qquad CG_n=G_n(C(z),zC(z)).

Here diam(G){\rm diam}(G) denotes the graph diameter. Diameter extremality conjecture. For n≥4n\geq4,

2=diam(PGn)≤diam(Gn)≤diam(CGn).2={\rm diam}(PG_n)\leq {\rm diam}(G_n)\leq {\rm diam}(CG_n).

Moreover, PGnPG_n is the only graph in the class of io-decomposable graphs of the Bell type whose diameter is 22 for all n≥4n\geq4. This conjecture identifies the Pascal and Catalan graphs as the lower and upper diameter extremizers in this class; the supplied text does not state whether it has been resolved.

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.