{"paper":{"title":"The crossing number of locally twisted cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bao Liu, Guoqing Wang, Haoli Wang, Wenping Zheng, Xirong Xu, Yuansheng Yang","submitted_at":"2011-03-22T08:06:27Z","abstract_excerpt":"The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing number of the hypercube. J. Graph Theory {\\bf 59}, 145--161 (2008)] which solves the upper bound conjecture on the crossing number of $n$-dimensional hypercube proposed by Erd\\H{o}s and Guy, we give upper and lower bounds of the crossing number of locally twisted cube, which is one of variants of hypercube."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4227","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"}