On Caccetta-Haggkvist Conjecture
General Mathematics
2008-05-30 v2
Abstract
We show that we cannot avoid the existence of at least one directed circuit of length less than or equal to (n/r) in a digraph on n vertices with out-degree greater than or equal to r. This is well-known Caccetta-Haggkvist problem.
Cite
@article{arxiv.0805.3631,
title = {On Caccetta-Haggkvist Conjecture},
author = {Dhananjay P. Mehendale},
journal= {arXiv preprint arXiv:0805.3631},
year = {2008}
}
Comments
23 pages. A proof of Seymour second neighborhood conjecture is added