On directed triangles in digraphs (Q1010591): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Penny E. Haxell / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Alexandr V. Kostochka / rank | |||
Normal rank |
Revision as of 02:11, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On directed triangles in digraphs |
scientific article |
Statements
On directed triangles in digraphs (English)
0 references
7 April 2009
0 references
Summary: Using a recent result of \textit{M. Chudnovsky}, \textit{P. Seymour}, and \textit{B. Sullivan} [''Cycles in dense digraphs'', Combinatorica 28, No.\,1, 1--18 (2008; Zbl 1174.05049)], we slightly improve two bounds related to the Caccetta-Häggkvist Conjecture [\textit{L. Caccetta} and \textit{R. Häggkvist}, ''On minimal digraphs with given girth'', Congressus Numerantium XXI, 181--187 (1978; Zbl 0406.05033) ]. Namely, we show that if \(\alpha\geq 0.35312\), then each \(n\)-vertex digraph \(D\) with minimum outdegree at least \(\alpha n\) has a directed 3-cycle. If \(\beta\geq 0.34564\), then every \(n\)-vertex digraph \(D\) in which the outdegree and the indegree of each vertex is at least \(\beta n\) has a directed 3-cycle.
0 references
digraph
0 references
minimum outdegree
0 references
derected cycle
0 references
indegree
0 references
outdegree
0 references