A parametric audit of a refuted logarithmic outdegree condition
Statement
Conjecture 6.25. If D is a digraph on n vertices with
∑
v∈V(D)
log(1 + 1
δ+
D
(v)) ≥ n log(1 + 1
r ),
then D has a cycle of length at most dn/r e.Counterexample: Take a transitive tournament of size n − 1, and replace the edge from the vertex of out-degree n − 2 to the vertex of out-degree zero with a path of length 2 in the opposite direction (thus increasing the number of vertices to n).
Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.