1 research outputs found

    The fine triangle intersections for maximum kite packings

    Full text link
    In this paper the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin(v)={(s,t): βˆƒ\exists a pair of maximum kite packings of order vv intersecting in ss blocks and s+ts+t triangles}. Let Adm(v)={(s,t): s+t\leq b_v, s,t are non-negative integers}, where bv=⌊v(vβˆ’1)/8βŒ‹b_v=\lfloor v(v-1)/8\rfloor. It is established that Fin(v)=Adm(v)βˆ–(bvβˆ’1,0),(bvβˆ’1,1)Fin(v)= Adm(v)\setminus {(b_v-1,0),(b_v-1,1)} for any integer v≑0,1(mod8)v\equiv 0,1 ({\rm mod} 8) and vβ‰₯8v\geq 8; Fin(v)=Adm(v)Fin(v)=Adm(v) for any integer v≑2,3,4,5,6,7(mod8)v\equiv 2,3,4,5,6,7 ({\rm mod} 8) and vβ‰₯4v\geq 4
    corecore