ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a connected tt-valenced graph, meaning that it has tt distinct valencies, with two main and two plain eigenvalues.

Valency conjecture. There exists a positive integer CC such that if t≥Ct\geq C, then Γ\Gamma is a strong graph.

This conjecture is posed as an analogue of a question of de Caen about the number of distinct valencies in connected graphs with three distinct eigenvalues. The source gives no resolution of the conjecture.

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.