On the Caccetta-Häggkvist Conjecture

@article{Shen2002OnTC,
  title={On the Caccetta-H{\"a}ggkvist Conjecture},
  author={Jian Shen},
  journal={Graphs and Combinatorics},
  year={2002},
  volume={18},
  pages={645-654}
}
It was conjectured by Caccetta and Häggkvist in 1978 that every digraph G with n vertices and minimum outdegree at least r contains a directed cycle of length at most dn=re. By refining an argument of Chvátal and Szemerédi, we prove that such G contains a directed cycle of length at most n=r þ 73. 
BETA

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

On minimal digraphs with given girth

  • L. Caccetta, R. Häggkvist
  • Proc. 9th S-E Conf. Combinatorics, Graph Theory…
  • 1978
Highly Influential
5 Excerpts

On minimal regular digraphs with given girth

  • M. Behzad, G. Chartrand, C. Wall
  • Fundam. Math. 69, 227–231
  • 1970

Similar Papers

Loading similar papers…