Long cycles in bipartite tournaments

DOI10.1016/0012-365X(94)00273-LMaRDI QIDQ1910552zbMATH OpenOpenAlexFDO

Authors Jianzhong Wang

Publication date 24 March 1996

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite tournamentcycledigraphloop

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Review text

Let \(D\) be an oriented complete bipartite graph and \(d^+(u)\) \((d^-(u))\) the outdegree (indegree) of any vertex of \(D\). The digraph \(D\) satisfies condition \(C(n)\) if \(d^+(u)+ d^-(v)\geq n\) whenever \(uv\) is not an arc of \(D\). A \(p\times q\) bipartite tournament \(T\) is an oriented complete bipartite graph with bipartition \((X, Y)\) where \(|X|= p\) and \(|Y|= q\). The main result established is: if \(T\) is a \(p\times q\) strong bipartite tournament satisfying \(C(n)\), then \(T\) contains a cycle of length at least 2 \(\min (n+ 1, p, q)\) unless \(n\) is even and isomorphic to a specified family of graphs.

Recommendations

• Cycles in multipartite tournaments
• On cycles in multipartite tournaments
• scientific article; zbMATH DE number 54800
• Extendable cycles in multipartite tournaments
• Cycle-pancyclism in bipartite tournaments II
• On the existence of specified cycles in bipartite tournaments
• Cycles in multipartite tournaments: Results and problems
• scientific article; zbMATH DE number 867712
• Cycle-pancyclism in bipartite tournaments I
• The cycle structure of regular multipartite tournaments

Cites work

• Cycles and paths in bipartite tournaments with spanning configurations
• Cycles and paths of many lengths in bipartite digraphs
• Degrees and Longest Paths in Bipartite Digraphs
• Graph theory
• scientific article; zbMATH DE number 4158647 (Why is no real title available?)
• Long paths and cycles in oriented graphs

Cited in

(15)

• When n-cycles in n-partite tournaments are longest cycles
• A sufficient condition for maximum cycles in bipartite digraphs
• Vertex-disjoint cycles of different lengths in multipartite tournaments
• Multipartite tournaments: a survey
• scientific article; zbMATH DE number 3878956 (Why is no real title available?)
• The longest cycles in special tournaments
• scientific article; zbMATH DE number 4158647 (Why is no real title available?)
• scientific article; zbMATH DE number 5371651 (Why is no real title available?)
• Longest paths and cycles in bipartite oriented graphs
• scientific article; zbMATH DE number 4068904 (Why is no real title available?)
• Cycle-pancyclism in bipartite tournaments II
• scientific article; zbMATH DE number 799967 (Why is no real title available?)
• scientific article; zbMATH DE number 851022 (Why is no real title available?)
• Tournament completions of bipartite tournaments and their augmented directed cycles
• Longest cycles in almost regular 3-partite tournaments

This page was built for publication: Long cycles in bipartite tournaments

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