On the maximum number of cyclic triples in oriented graphs

Authors
Beineke, LW Harary, F
Citation
Lw. Beineke et F. Harary, On the maximum number of cyclic triples in oriented graphs, J COMB TH B, 81(2), 2001, pp. 165-176
Citations number
4
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956 → ACNP
Volume
81
Issue
2
Year of publication
2001
Pages
165 - 176
Database
ISI
SICI code
0095-8956(200103)81:2<165:OTMNOC>2.0.ZU;2-U
Abstract
The maximum number of cyclic triples in an oriented graph of a given order is well known, being realized by the regular and near-regular tournaments. We consider the the responding problem of determining the maximum number of cyclic triples in an oriented graph with a given number of arcs. A formula is found provided that the number of vertices is not too small relative to the number of arcs. (C) 2001 Academic Press.