The Maximum Number of Strongly Connected Subtournaments*
From MaRDI portal
Publication:5341596
DOI10.4153/CMB-1965-035-xzbMath0132.21303OpenAlexW2312804793MaRDI QIDQ5341596
Lowell W. Beineke, Frank Harary
Publication date: 1965
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1965-035-x
Related Items
The maximal number of induced complete bipartite graphs ⋮ On the number of 7-cycles in regular \(n\)-tournaments ⋮ Minimizing cycles in tournaments and normalized \(q\)-norms ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Paths of given length in tournaments ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ The chromatic uniqueness of complete bipartite graphs ⋮ Lengths of words in transformation semigroups generated by digraphs ⋮ Graph theory ⋮ The maximal number of induced \(r\)-partite subgraphs ⋮ On the problem of reconstructing a tournament from subtournaments ⋮ On 5-Cycles and 6-Cycles in Regular n-Tournaments ⋮ Cycles in digraphs– a survey ⋮ The Shifted Turán Sieve Method on Tournaments ⋮ On the maximum number of cyclic triples in oriented graphs ⋮ Cycles of a given length in tournaments ⋮ No additional tournaments are quasirandom-forcing
