{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3BEXSFDJWBLYKCV4CFUVWK3ILS","short_pith_number":"pith:3BEXSFDJ","schema_version":"1.0","canonical_sha256":"d849791469b057850abc11695b2b685ca0a1fb2326a8ca6f9ad44e6ff066d406","source":{"kind":"arxiv","id":"2307.11983","version":1},"attestation_state":"computed","paper":{"title":"Extremal problems for a matching and any other graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiutao Zhu, Yaojun Chen","submitted_at":"2023-07-22T05:23:57Z","abstract_excerpt":"For a family of graphs $\\F$, a graph is called $\\F$-free if it does not contain any member of $\\F$ as a subgraph. The generalized Tur\\'an number $\\ex(n,K_r,\\F)$ is the maximum number of $K_r$ in an $n$-vertex $\\F$-free graph and $\\ex(n,K_2,\\F)=\\ex(n,\\F)$, i.e., the classical Tur\\'an number. Let $M_{s+1}$ be a matching on $s+1$ edges and $F$ be any graph. In this paper, we determine $\\ex(n,K_r, \\{M_{s+1},F\\})$ apart from a constant additive term and also give a condition when the error constant term can be determined. In particular, we give the exact value of $\\ex(n,\\{M_{s+1},F\\})$ for $F$ bein"},"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":"2307.11983","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-22T05:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"4fbaa9a917765b51bdd2d1ed66d8f970518f4e8ef3c5fe027f6e580ebeb7c763","abstract_canon_sha256":"4a7462f55908696c748576c516cdccdf3003ac9a37365a0d37781dcdc3a27d41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:37.119160Z","signature_b64":"NBXvCRf6nP49c/LBAhhIoLGRy0EtDNbjS7GPdexlrTflzygi9IaoUNDtNVdrOtXWd71Gi19a1u9W5tPVhyB7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d849791469b057850abc11695b2b685ca0a1fb2326a8ca6f9ad44e6ff066d406","last_reissued_at":"2026-07-05T06:33:37.118534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:37.118534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal problems for a matching and any other graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiutao Zhu, Yaojun Chen","submitted_at":"2023-07-22T05:23:57Z","abstract_excerpt":"For a family of graphs $\\F$, a graph is called $\\F$-free if it does not contain any member of $\\F$ as a subgraph. The generalized Tur\\'an number $\\ex(n,K_r,\\F)$ is the maximum number of $K_r$ in an $n$-vertex $\\F$-free graph and $\\ex(n,K_2,\\F)=\\ex(n,\\F)$, i.e., the classical Tur\\'an number. Let $M_{s+1}$ be a matching on $s+1$ edges and $F$ be any graph. In this paper, we determine $\\ex(n,K_r, \\{M_{s+1},F\\})$ apart from a constant additive term and also give a condition when the error constant term can be determined. In particular, we give the exact value of $\\ex(n,\\{M_{s+1},F\\})$ for $F$ bein"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.11983","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.11983/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.11983","created_at":"2026-07-05T06:33:37.118620+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.11983v1","created_at":"2026-07-05T06:33:37.118620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.11983","created_at":"2026-07-05T06:33:37.118620+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BEXSFDJWBLY","created_at":"2026-07-05T06:33:37.118620+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BEXSFDJWBLYKCV4","created_at":"2026-07-05T06:33:37.118620+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BEXSFDJ","created_at":"2026-07-05T06:33:37.118620+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17322","citing_title":"Tur\\'an numbers of cycles plus a general graph","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS","json":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS.json","graph_json":"https://pith.science/api/pith-number/3BEXSFDJWBLYKCV4CFUVWK3ILS/graph.json","events_json":"https://pith.science/api/pith-number/3BEXSFDJWBLYKCV4CFUVWK3ILS/events.json","paper":"https://pith.science/paper/3BEXSFDJ"},"agent_actions":{"view_html":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS","download_json":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS.json","view_paper":"https://pith.science/paper/3BEXSFDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.11983&json=true","fetch_graph":"https://pith.science/api/pith-number/3BEXSFDJWBLYKCV4CFUVWK3ILS/graph.json","fetch_events":"https://pith.science/api/pith-number/3BEXSFDJWBLYKCV4CFUVWK3ILS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS/action/storage_attestation","attest_author":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS/action/author_attestation","sign_citation":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS/action/citation_signature","submit_replication":"https://pith.science/pith/3BEXSFDJWBLYKCV4CFUVWK3ILS/action/replication_record"}},"created_at":"2026-07-05T06:33:37.118620+00:00","updated_at":"2026-07-05T06:33:37.118620+00:00"}