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


Decomposition of large uniform hypergraphs
Authors:Zbigniew Lonc  Miroslaw Truszczyński
Institution:(1) Institute of Mathematics, Technical University of Warsaw, pl. Jednosacuteci Robotniczej 1, 00661 Warsaw, Poland
Abstract:We determine a minimum cardinality family Fscr n, k (resp. hamilt n, k ) ofn-uniform,k-edge hypergraphs satisfying the following property: all, except for finitely many,n-uniform hypergraphs satisfying the divisibility condition have an Fscr n, k -decomposition (resp. vertex hamilt n, k -decomposition).
Keywords:05C70
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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