{"paper":{"title":"Vertex-cover in random graphs with small connectivity: an exact solution","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"E. Caglioti","submitted_at":"2002-11-19T10:44:36Z","abstract_excerpt":"This paper has been withdrawn by the author, due to the fact that the main result in it has already been obtained in [1] for any c < e, see also [2] and [3].\n Moreover the formula which gives the minimal vertex-cover in a tree\n (see the abstract) has already been derived in [4]. I thank M. Bauer, O. Golinelli, F. Ricci-Tersenghi, G. Semerjian and M. Weigt for having brought to my attention [1] and M.B. and O.G. for [4].\n  [1] M. Bauer and O. Golinelli, Eur. Phys. J. B 24, 339-352 (2001);\n  [2] R. M. Karp and M. Sipser, Proc. 22nd IEEE Symposium on Foundations of Computing,(1981), 364-375;\n  [3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0211403","kind":"arxiv","version":2},"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"}