On the maximum number of cyclic triples in oriented graphs

DOI10.1006/JCTB.2000.1995MaRDI QIDQ1850518zbMATH OpenOpenAlexFDO

Authors L. W. Beineke, Frank Harary

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

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

Recommendations

• Cycles in oriented 3-graphs
• Cyclic triangle factors in regular tournaments
• On the maximum number of spanning copies of an orientation in a tournament
• Orientations making \(k\)-cycles cyclic
• On the number of orientations of random graphs with no directed cycles of a given length

Cites work

• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• scientific article; zbMATH DE number 3194324 (Why is no real title available?)
• ON THE METHOD OF PAIRED COMPARISONS
• The Maximum Number of Strongly Connected Subtournaments^*

Cited in

(5)

• Directed simplices in higher order tournaments
• A condition for a family of triangles to be orientable to a cyclic order
• Cycles in oriented 3-graphs
• The number of 4-cycles in triangle-free oriented graphs
• Orientations making \(k\)-cycles cyclic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850518)