ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a digraph DD, let ell(D)ell(D) be the length of a longest directed path, let g(D)g(D) be its girth, and let delta+(D)delta^+(D) be its minimum out-degree. Proposed weaker Thomassé conjecture. There is some constant c>0c>0 such that

ℓ(D)≥c g(D) δ+(D)\ell(D) \ge c\,g(D)\,\delta^+(D)

for every digraph DD.

This conjecture weakens Thomassé's proposed bound and is motivated by the paper's lower bounds for regular digraphs. The supplied text does not state whether it is known or remains open, so its database status is left 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.