ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph. A pendant path of GG is a path such that one of its end vertices has degree 11, the other end has degree at least 33, and all its internal vertices have degree 22. For a positive integer kk, let pk(G)p_k(G) be the number of pendant paths of length kk in GG, and let qk(G)q_k(G) be the number of vertices of degree at least 33 that are an end vertex of some pendant path of length kk.

Saito–Woei's plateaux conjecture. For any positive integer kk and any graph GG, some Laplacian eigenvalue of GG has multiplicity at least

pk(G)−qk(G).p_k(G)-q_k(G).

The conjecture arose from the study of Laplacian eigenvalue multiplicities in dendritic trees. The source paper states that it follows from a more general result for both Laplacian and signless Laplacian eigenvalues.

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.