ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be any graph, with b(G)b(G) its bondage number and Δ(G)\Delta(G) its maximum degree. Teschner's conjecture.

b(G)⩽32Δ(G).b(G)\leqslant\frac{3}{2}\Delta(G).

The source notes that equality is attained by Cartesian products Kn×KnK_n\times K_n, and presents the universal upper bound as open.

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.