ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture Every digraph in which each vertex has outdegree at least kk contains kk directed cycles C1,…,CkC_1, \ldots, C_k such that CjC_j meets ∪i=1j−1Ci\cup_{i=1}^{j-1}C_i in at most one vertex, 2≤j≤k2 \leq j \leq k.

Record

Added
Links

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.