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

DOI10.1016/0012-365X(94)00025-EMaRDI QIDQ1897447zbMATH OpenOpenAlexFDO

Authors Shinsei Tazawa, Chie Nara, J. 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

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

Recommendations

• The number of 4-cycles in a graph
• The number of triangles in a \(K_ 4\)-free graph
• The number of $4$-cycles and the cyclomatic number of a finite simple graph
• On the maximum number of cyclic triples in oriented graphs
• The maximum number of triangles in a \(K_4\)-free graph
• Four-cycles in graphs without a given even cycle
• Enumeration of cyclically 4-connected cubic graphs
• Triangle-free four-chromatic graphs
• Triangle-free graphs with the maximum number of cycles
• Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs

Cites work

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

Cited in

(3)

• THE NUMBER OF DISTINCT 4-CYCLES AND 2-MATCHINGS OF SOME ZERO-DIVISOR GRAPHS
• The number of $4$-cycles and the cyclomatic number of a finite simple graph
• Which graphs can be counted in \(C_4\)-free graphs?

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

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