The tight bound on the number of C₃-free vertices on regular 3-partite tournaments

MaRDI QIDQ3166111zbMATH OpenFDO

Authors M. Olsen, A. P. Figueroa

Publication date 21 October 2012

zbMATH Keywords

3-partite tournament\(\overarrow{C_3}\)-free vertices

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
• On the vertices of a 3-partite tournament not in triangles
• scientific article; zbMATH DE number 733162
• scientific article; zbMATH DE number 5240517
• On cycles in regular 3-partite tournaments

Cited in

(4)

• The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
• On the vertices of a 3-partite tournament not in triangles
• Two-path convexity in clone-free regular multipartite tournaments
• Packing edge-disjoint triangles in regular and almost regular tournaments

This page was built for publication: The tight bound on the number of \(\vec{C_3}\)-free vertices on regular 3-partite tournaments

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