On the maximum number of cyclic triples in oriented graphs

DOI10.1006/JCTB.2000.1995zbMath1023.05068OpenAlexW2052352256MaRDI QIDQ1850518

Frank Harary, Lowell W. Beineke

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1995

zbMATH Keywords

tournaments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• The Maximum Number of Strongly Connected Subtournaments^*
• ON THE METHOD OF PAIRED COMPARISONS
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum number of cyclic triples in oriented graphs