Part of this work was done while the author was at Steklov Mathematical Institute, supported by the Russian Foundation for Basic Research, and at Toyota Technological Institute, Chicago.
On the Caccetta–Häggkvist Conjecture with Forbidden Subgraphs†
Article first published online: 16 NOV 2012
© 2012 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 74, Issue 2, pages 236–248, October 2013
How to Cite
Razborov, A. A. (2013), On the Caccetta–Häggkvist Conjecture with Forbidden Subgraphs. J. Graph Theory, 74: 236–248. doi: 10.1002/jgt.21707
- Issue published online: 2 AUG 2013
- Article first published online: 16 NOV 2012
- Manuscript Revised: 29 AUG 2012
- Manuscript Received: 26 JUL 2011
- Russian Foundation for Basic Research
- Toyota Technological Institute
The Caccetta–Häggkvist conjecture developed in 1978 asserts that every oriented graph on n vertices without oriented cycles of length must contain a vertex of outdegree at most . It has a rather elaborate set of (conjectured) extremal configurations. In this paper, we consider the case that received quite a significant attention in the literature. We identify three oriented graphs on four vertices each that are missing as an induced subgraph in all known extremal examples and prove the Caccetta–Häggkvist conjecture for oriented graphs missing as induced subgraphs any of these oriented graphs, along with . Using a standard method, we can also lift the restriction of being induced, though this makes graphs in our list slightly more complicated.