{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:J4ABJXMVTGO67GENQKNBOQH76Y","short_pith_number":"pith:J4ABJXMV","schema_version":"1.0","canonical_sha256":"4f0014dd95999def988d829a1740fff62b4198f04e0118c788fa65a43d51a3ac","source":{"kind":"arxiv","id":"1206.1427","version":1},"attestation_state":"computed","paper":{"title":"Combined degree and connectivity conditions for H-linked graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Pfender","submitted_at":"2012-06-07T09:15:40Z","abstract_excerpt":"For a given multigraph H, a graph G is H-linked, if |G| \\geq |H| and for every injective map {\\tau}: V (H) \\rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\\tau} (u) - {\\tau} (v) path. To guarantee that a G is H-linked, you need a minimum degree larger than |G|/2. This situation changes, if you know that G has a certain connectivity k. Depending on k, even a minimum degree independent of |G| may suffice. Let {\\delta}(k, H, N) be the minimum number, such that every k-connected graph G with |G| = N and {\\delta}(G) \\geq {\\delta}(k,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1206.1427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T09:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"b057a4e27f3bf72ac1c5ad85355591ce65fc531f94109cacf4377c8d8d38d3f9","abstract_canon_sha256":"070601daf9f07004b8c560203bf239b6cb3b9c83b497332871edb4c96076d3e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:05.137399Z","signature_b64":"+vUDTWtPeJvOsx2b9IMTzuJf5oakyFtb4aj11Z5LxdmABv0A3QHyurszabQrAPn7N4okq+yx59/BpmurJEGADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f0014dd95999def988d829a1740fff62b4198f04e0118c788fa65a43d51a3ac","last_reissued_at":"2026-05-18T03:54:05.136831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:05.136831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combined degree and connectivity conditions for H-linked graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Pfender","submitted_at":"2012-06-07T09:15:40Z","abstract_excerpt":"For a given multigraph H, a graph G is H-linked, if |G| \\geq |H| and for every injective map {\\tau}: V (H) \\rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\\tau} (u) - {\\tau} (v) path. To guarantee that a G is H-linked, you need a minimum degree larger than |G|/2. This situation changes, if you know that G has a certain connectivity k. Depending on k, even a minimum degree independent of |G| may suffice. Let {\\delta}(k, H, N) be the minimum number, such that every k-connected graph G with |G| = N and {\\delta}(G) \\geq {\\delta}(k,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1427","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.1427","created_at":"2026-05-18T03:54:05.136932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1427v1","created_at":"2026-05-18T03:54:05.136932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1427","created_at":"2026-05-18T03:54:05.136932+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4ABJXMVTGO6","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4ABJXMVTGO67GEN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4ABJXMV","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y","json":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y.json","graph_json":"https://pith.science/api/pith-number/J4ABJXMVTGO67GENQKNBOQH76Y/graph.json","events_json":"https://pith.science/api/pith-number/J4ABJXMVTGO67GENQKNBOQH76Y/events.json","paper":"https://pith.science/paper/J4ABJXMV"},"agent_actions":{"view_html":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y","download_json":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y.json","view_paper":"https://pith.science/paper/J4ABJXMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1427&json=true","fetch_graph":"https://pith.science/api/pith-number/J4ABJXMVTGO67GENQKNBOQH76Y/graph.json","fetch_events":"https://pith.science/api/pith-number/J4ABJXMVTGO67GENQKNBOQH76Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y/action/storage_attestation","attest_author":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y/action/author_attestation","sign_citation":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y/action/citation_signature","submit_replication":"https://pith.science/pith/J4ABJXMVTGO67GENQKNBOQH76Y/action/replication_record"}},"created_at":"2026-05-18T03:54:05.136932+00:00","updated_at":"2026-05-18T03:54:05.136932+00:00"}