首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A Note on a Packing Problem in Transitive Tournaments
Authors:Agnieszka Görlich  Monika Pilśniak  Mariusz Woźniak
Institution:(1) University of Science and Technology AGH, Al.Mickiewicza 30, 30-059 Kraków, Poland
Abstract:Let TTn be a transitive tournament on n vertices. We show that for any directed acyclic graph G of order n and of size not greater than MediaObjects/s00373-005-0652-xflb1.gif two directed graphs isomorphic to G are arc disjoint subgraphs of TTn. Moreover, this bound is generally the best possible. The research partially supported by KBN grant 2 P03A 016 18
Keywords:Packing of digraphs  Transitive tournaments
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号