ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥6d\ge 6. A bipartite (d,3,−4)(d,3,-4)-graph is a bipartite graph of degree dd, diameter 33, and defect 44.

Non-existence conjecture. There is no bipartite (d,3,−4)(d,3,-4)-graph with d≥6d\ge 6.

The conjecture extends the paper's proved non-existence result for bipartite (7,3,−4)(7,3,-4)-graphs and its observations concerning the cases d=5d=5 and d=6d=6. It asserts that bipartite graphs of diameter 33 and defect 44 do not exist in any degree at least 66.

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.