ProbXiv
sign in
Problem archiveProblem record

Statement

WOW-284 asserts that the minimum dual degree of every connected graph of order at least three and girth at least five is at most the negative of its least distance eigenvalue. The paper refutes it with exact counterexamples of orders 38, 39, 40, 42 and 50, and develops a structural theory of the failure.

Record

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    Samuil Petkov, using ChatGPT-5.6 Sol Pro

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai assisted
    — a person led the work and used a model along the way.

    The author credits ChatGPT-5.6 Sol Pro with adversarial proof checking, proof exploration and Lean formalization, and assumes full responsibility for the mathematics, attribution and conclusions.

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.