Abstract
Letcbe the smallest possible value such that every digraph onnvertices with minimum outdegree at leastcncontains a directed triangle. It was conjectured by Caccetta and Häggkvist in 1978 thatc=1/3. Recently Bondy showed thatc≤(26-3)/5=0.3797... by using some counting arguments. In this note, we prove thatc≤3-7=0.3542.... © 1998 Academic Press.
Cite
CITATION STYLE
APA
Shen, J. (1998). Directed Triangles in Digraphs. Journal of Combinatorial Theory. Series B, 74(2), 405–407. https://doi.org/10.1006/jctb.1998.1839
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free