{"paper":{"title":"Two sufficient conditions for the existence of Hamilton cycles in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bing Chen, Bo Ning, Shenggui Zhang","submitted_at":"2012-09-18T10:10:07Z","abstract_excerpt":"Let $G$ be a graph on $n\\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced claw of $G$ has degree at least $n/2$, and claw-\\emph{o}-heavy if each induced claw of it has a pair of end vertices with degree sum at least $n$. In this paper we prove two results: (1) Every 2-connected claw-$o$-heavy graph $G$ is Hamiltonian if every pair of vertices $u,v$ in a subgraph $H\\cong Z_1$ contained in an induced subgraph $Z_2$ of $G$ with $d_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3899","kind":"arxiv","version":4},"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"}