{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HMITZHIQQ4HBWFHWOFP4FQDZX3","short_pith_number":"pith:HMITZHIQ","schema_version":"1.0","canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","source":{"kind":"arxiv","id":"1906.09185","version":2},"attestation_state":"computed","paper":{"title":"The size Ramsey number of graphs with bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Liebenau, David R. Wood, Liana Yepremyan, Nina Kamcev","submitted_at":"2019-06-21T15:17:30Z","abstract_excerpt":"A graph $G$ is Ramsey for a graph $H$ if every 2-colouring of the edges of $G$ contains a monochromatic copy of $H$. We consider the following question: if $H$ has bounded treewidth, is there a `sparse' graph $G$ that is Ramsey for $H$? Two notions of sparsity are considered. Firstly, we show that if the maximum degree and treewidth of $H$ are bounded, then there is a graph $G$ with $O(|V(H)|)$ edges that is Ramsey for $H$. This was previously only known for the smaller class of graphs $H$ with bounded bandwidth. On the other hand, we prove that the treewidth of a graph $G$ that is Ramsey for "},"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":"1906.09185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-21T15:17:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"40f8415d9549b139d2ca7761370ebe6b832dd475b46aaafd7e5c0f96be22c524","abstract_canon_sha256":"d4cab77d7a220653d7ecd2743078ab958159ad3cc15f42bb9db26a69d1b5749f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:23.830525Z","signature_b64":"A/0hGTs/6FmZSYA077JgELlKoMcust9l0DsneP2M6OStTT/9ghtAjOQ8hQssDjIA4wd0OCzatPjvKMS0pwJ6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b113c9d10870e1b14f6715fc2c079bef5cbd347e80ff7e801803760624da3c0","last_reissued_at":"2026-05-17T23:39:23.829636Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:23.829636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The size Ramsey number of graphs with bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Liebenau, David R. Wood, Liana Yepremyan, Nina Kamcev","submitted_at":"2019-06-21T15:17:30Z","abstract_excerpt":"A graph $G$ is Ramsey for a graph $H$ if every 2-colouring of the edges of $G$ contains a monochromatic copy of $H$. We consider the following question: if $H$ has bounded treewidth, is there a `sparse' graph $G$ that is Ramsey for $H$? Two notions of sparsity are considered. Firstly, we show that if the maximum degree and treewidth of $H$ are bounded, then there is a graph $G$ with $O(|V(H)|)$ edges that is Ramsey for $H$. This was previously only known for the smaller class of graphs $H$ with bounded bandwidth. On the other hand, we prove that the treewidth of a graph $G$ that is Ramsey for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09185","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.09185","created_at":"2026-05-17T23:39:23.829802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09185v2","created_at":"2026-05-17T23:39:23.829802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09185","created_at":"2026-05-17T23:39:23.829802+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMITZHIQQ4HB","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMITZHIQQ4HBWFHW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMITZHIQ","created_at":"2026-05-18T12:33:18.533446+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/HMITZHIQQ4HBWFHWOFP4FQDZX3","json":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3.json","graph_json":"https://pith.science/api/pith-number/HMITZHIQQ4HBWFHWOFP4FQDZX3/graph.json","events_json":"https://pith.science/api/pith-number/HMITZHIQQ4HBWFHWOFP4FQDZX3/events.json","paper":"https://pith.science/paper/HMITZHIQ"},"agent_actions":{"view_html":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3","download_json":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3.json","view_paper":"https://pith.science/paper/HMITZHIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09185&json=true","fetch_graph":"https://pith.science/api/pith-number/HMITZHIQQ4HBWFHWOFP4FQDZX3/graph.json","fetch_events":"https://pith.science/api/pith-number/HMITZHIQQ4HBWFHWOFP4FQDZX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/action/storage_attestation","attest_author":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/action/author_attestation","sign_citation":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/action/citation_signature","submit_replication":"https://pith.science/pith/HMITZHIQQ4HBWFHWOFP4FQDZX3/action/replication_record"}},"created_at":"2026-05-17T23:39:23.829802+00:00","updated_at":"2026-05-17T23:39:23.829802+00:00"}