Local average outdegree and short directed cycles
Statement
Conjecture 6. 2 6. (Shen [32]) Let G be a digraph with n vertices and minimum outdegree at least one. If δ+
G
(v) + δ+
G
(u) ≥ 2r for every edge (u, v ) in G, then the girth g of G is at most
dn/r e.Note: This was proved by Shen for r = 2 in [32].
#6.8 UnCategorized
The following conjecture would imply that in a counterexample for Caccetta-H¨ aggkvist for r =
n/ 3, one can order the vertices so that at least 75% of the edges go from left to right:
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.