ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P⊆G\mathcal{P} \subseteq \mathcal{G} be additive and hereditary. A graph GG is vertex-γP\gamma_{\mathcal{P}}-critical if its vertex domination number with respect to P\mathcal{P} has the criticality property used in the paper, and let bP+(G)b_{\mathcal{P}}^+(G) denote its upper bondage number and Δ(G)\Delta(G) its maximum degree. Teschner's conjecture. For any vertex-γP\gamma_{\mathcal{P}}-critical graph GG,

bP+(G)≤1.5Δ(G).b_{\mathcal{P}}^+(G) \leq 1.5\Delta(G).

The conjecture is presented as the main outstanding conjecture on the ordinary bondage number when P=G\mathcal{P}=\mathcal{G}; its general status is not resolved in the supplied source.

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.