ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt be a real number, and let GG be a graph. A graph is minimally tt-tough when τ(G)=t\tau(G)=t and τ(G−e)<t\tau(G-e)<t for every edge e∈E(G)e\in E(G), where τ(G)\tau(G) denotes its toughness. It is Generalized Kriesell's conjecture that every minimally tt-tough graph has a vertex of degree ⌈2t⌉\lceil 2t\rceil. This naturally generalizes Kriesell's conjecture for t=1t=1, and the paper reports that the associated Kriesell conjecture was recently disproved.

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.