On 4‐cycles in random bipartite tournaments

DOI10.1002/JGT.3190070207zbMath0514.05051OpenAlexW2129729598MaRDI QIDQ3659820

Ove Frank, Béla Bollobás, Michał Karoński

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070207

zbMATH Keywords

bipartite tournamentcycles in random digraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

The number of 4-cycles in triangle-free oriented graphs ⋮ The shifted Turán sieve method on tournaments. II ⋮ A note on the cardinality of certain classes of unlabeled multipartite tournaments

Cites Work

• On the Distribution of 4-Cycles in Random Bipartite Tournaments
• ON THE METHOD OF PAIRED COMPARISONS
• On the method of paired comparisons

This page was built for publication: On 4‐cycles in random bipartite tournaments