On Caccetta-Haggkvist Conjecture
| dc.creator | Mehendale, Dhananjay P. | |
| dc.date | 2008-05-23 | |
| dc.date | 2008-05-30 | |
| dc.date.accessioned | 2026-07-07T09:41:31Z | |
| dc.date.available | 2026-07-07T09:41:31Z | |
| dc.description | 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. | |
| dc.description | 23 pages. A proof of Seymour second neighborhood conjecture is added | |
| dc.identifier | https://arxiv.org/abs/0805.3631 | |
| dc.identifier | http://arxiv.org/abs/0805.3631 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161853 | |
| dc.subject | General Mathematics | |
| dc.title | On Caccetta-Haggkvist Conjecture | |
| dc.type | text |