The number of 4-cycles in triangle-free oriented graphs

DOI10.1016/0012-365X(94)00025-EzbMath0833.05044OpenAlexW2035458359MaRDI QIDQ1897447

Chie Nara, Shinsei Tazawa, John W. Moon

Publication date: 27 August 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00025-e

zbMATH Keywords

extremal graphsoriented 4-cyclestriangle-free oriented graphs

Mathematics Subject Classification ID

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

Cites Work

• The maximal number of induced complete bipartite graphs
• On the Distribution of 4-Cycles in Random Bipartite Tournaments
• On 4‐cycles in random bipartite tournaments

This page was built for publication: The number of 4-cycles in triangle-free oriented graphs