The fine triangle intersections for maximum kite packings

In this paper, the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin(v) = {(s, t): ? a pair of maximum kite packings of order v intersecting in s blocks and s + t triangles}. Let Adm(v) = {(s, t): s + t ≤ b _v , s, t are non-negative integers}, where b _v = └v (v ?1)/8┘. It is established that Fin(v) = Adm(v)\{(b _v ? 1, 0), (b _v ? 1, 1)} for any integer v ≡ 0,1 (mod 8) and v ≥ 8; Fin(v) = Adm(v) for any integer v ≡ 2, 3, 4, 5, 6,7 (mod 8) and v ≥ 4.