Abstract
For a tournament T, let ν3(T) denote the maximum number of pairwise edge-disjoint triangles (directed cycles of length 3) in T. Let ν3(n) denote the minimum of ν3(T) ranging over all regular tournaments with n vertices (n odd). We conjecture that ν3(n)=(1+o(1))n2/9 and prove thatn211.43(1−o(1))≤ν3(n)≤n29(1+o(1)) improving upon the best known upper bound of n2−18 and lower bound of n211.5(1−o(1)). The result is generalized to tournaments where the indegree and outdegree at each vertex may differ by at most βn.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
