{"paper":{"title":"The fine triangle intersections for maximum kite packings","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guizhi Zhang, Tao Feng, Yanxun Chang","submitted_at":"2012-07-17T10:03:34Z","abstract_excerpt":"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 $v$ intersecting in $s$ blocks and $s+t$ triangles$}$. Let $Adm(v)={(s,t): s+t\\leq b_v, s,t$ are non-negative integers$}$, where $b_v=\\lfloor v(v-1)/8\\rfloor$. It is established that $Fin(v)= Adm(v)\\setminus {(b_v-1,0),(b_v-1,1)}$ for any integer $v\\equiv 0,1 ({\\rm mod} 8)$ and $v\\geq 8$; $Fin(v)=Adm(v)$ for any integer $v\\equiv 2,3,4,5,6,7 ({\\rm mod} 8)$ and $v\\geq 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3931","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}