For black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4KFMMFW-F&_mathId=mml1&_user=10&_cdi=5632&_rdoc=11&_handle=V-WA-A-W-WV-MsSAYVA-UUA-U-AAZCWAYYYY-AAZWDEEZYY-VWUDVCVY-WV-U&_acct=C000050221&_version=1&_userid=10&md5=3737d862ac9601b21a3705cfd45e85b0"" title=""Click to view the MathML source"">c2 we prove that a regular c-partite tournament with black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4KFMMFW-F&_mathId=mml2&_user=10&_cdi=5632&_rdoc=11&_handle=V-WA-A-W-WV-MsSAYVA-UUA-U-AAZCWAYYYY-AAZWDEEZYY-VWUDVCVY-WV-U&_acct=C000050221&_version=1&_userid=10&md5=9539eddac575be673981dea8c7a507d8"" title=""Click to view the MathML source"">r2 vertices in each partite set contains a directed path with exactly two vertices from each partite set. Furthermore, if black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4KFMMFW-F&_mathId=mml3&_user=10&_cdi=5632&_rdoc=11&_handle=V-WA-A-W-WV-MsSAYVA-UUA-U-AAZCWAYYYY-AAZWDEEZYY-VWUDVCVY-WV-U&_acct=C000050221&_version=1&_userid=10&md5=4a9a125f62a38aa1c7fcde42482154f4"" title=""Click to view the MathML source"">c4, then we will show that almost all regular c-partite tournaments D contain a directed path with exactly black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4KFMMFW-F&_mathId=mml4&_user=10&_cdi=5632&_rdoc=11&_handle=V-WA-A-W-WV-MsSAYVA-UUA-U-AAZCWAYYYY-AAZWDEEZYY-VWUDVCVY-WV-U&_acct=C000050221&_version=1&_userid=10&md5=ca6ed60b0712b89eca7fbc0f37cc506b"" title=""Click to view the MathML source"">r-s vertices from each partite set for each given integer , if r is the cardinality of each partite set of D. Some related results are also presented.