American Institute of Mathematics, Palo Alto, California
Maria Chudnovsky, Paul Seymour, and Robin Thomas
If G is an n-vertex directed graph with minimum outdegree at least n/k, then G has a directed cycle of length at most k.
This has a number of variants and strengthenings, and in particular it has numerous connections with additive number theory. The workshop aims to clarify and develop these variants, and to bring together people working on different aspects of the conjecture in the hope of finding a solution.
The workshop schedule.
A report on the workshop activities.
A list of open problems.