The Fine Triangle Intersections for Maximum Kite Packings  

作　　者：Gui Zhi ZHANG Yan Xun CHANG Tao FENG 

机构地区：[1]Institute of Mathematics, Beijing Jiaotong University [2]School of Mathematical Sciences, Hulunbuir College

出　　处：《Acta Mathematica Sinica,English Series》2013年第5期867-882,共16页数学学报（英文版）

基　　金：Supported by the Fundamental Research Funds for the Central Universities(Grant Nos.2011JBZ012 and 2011JBM298);National Natural Science Foundation of China(Grant Nos.61071221 and 10901016)

摘　　要：In this paper, the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin（v） = {（s, t） ： E← a pair of maximum kite packings of order v intersecting in s blocks and s ＋ t triangles}. Let Adm（v） = {（s,t） ： s ＋ t≤by, s, t are non-negative integers}, where by = [v（v - 1）/8]. It is established that Fin（v） = Adm（v）／{（bv - 1,0）, （by - 1, 1）} for any integer v - 0, 1 （rood 8） and v ≥ 8; Fin（v） = Adm（v） for any integer v = 2, 3, 4, 5, 6, 7 （rood 8） and v≥ 4.In this paper, the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin（v） = {（s, t） ： E← a pair of maximum kite packings of order v intersecting in s blocks and s ＋ t triangles}. Let Adm（v） = {（s,t） ： s ＋ t≤by, s, t are non-negative integers}, where by = [v（v - 1）/8]. It is established that Fin（v） = Adm（v）／{（bv - 1,0）, （by - 1, 1）} for any integer v - 0, 1 （rood 8） and v ≥ 8; Fin（v） = Adm（v） for any integer v = 2, 3, 4, 5, 6, 7 （rood 8） and v≥ 4.

关 键 词：Kite packing triangle intersection fine triangle intersection 

分 类 号：O157.5[理学—数学]