{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O2QY4LRYI7UU4I5OYGQE6PBNZY","short_pith_number":"pith:O2QY4LRY","schema_version":"1.0","canonical_sha256":"76a18e2e3847e94e23aec1a04f3c2dce3e591481c2d72a6002ad2e6aa41a7452","source":{"kind":"arxiv","id":"1708.04504","version":2},"attestation_state":"computed","paper":{"title":"Directed Ramsey number for trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matija Bucic, Shoham Letzter","submitted_at":"2017-08-15T14:14:50Z","abstract_excerpt":"In this paper, we study Ramsey-type problems for directed graphs. We first consider the $k$-colour oriented Ramsey number of $H$, denoted by $\\overrightarrow{R}(H,k)$, which is the least $n$ for which every $k$-edge-coloured tournament on $n$ vertices contains a monochromatic copy of $H$. We prove that $ \\overrightarrow{R}(T,k) \\le c_k|T|^k$ for any oriented tree $T$. This is a generalisation of a similar result for directed paths by Chv\\'atal and by Gy\\'arf\\'as and Lehel, and answers a question of Yuster. In general, it is tight up to a constant factor.\n  We also consider the $k$-colour direc"},"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":"1708.04504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-15T14:14:50Z","cross_cats_sorted":[],"title_canon_sha256":"8ab6bb7b2a2765a3c414aa44f228dfcd5cf161fc8e8d740ed0124597c53baa71","abstract_canon_sha256":"31f5a4f314923f224c92dd36ecf5cf6ab5670d6dfae4b7ca8b77d8e3c5f3b9bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.824963Z","signature_b64":"1/Zgu7XykK9xSjW/o3ggZnxk4Zn0VumWNMpdO8BqVl8ss22PaJ382tEKRXu/TDoJwbA86a/nGw8YMrxRsmxuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a18e2e3847e94e23aec1a04f3c2dce3e591481c2d72a6002ad2e6aa41a7452","last_reissued_at":"2026-05-17T23:47:12.824555Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.824555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Ramsey number for trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matija Bucic, Shoham Letzter","submitted_at":"2017-08-15T14:14:50Z","abstract_excerpt":"In this paper, we study Ramsey-type problems for directed graphs. We first consider the $k$-colour oriented Ramsey number of $H$, denoted by $\\overrightarrow{R}(H,k)$, which is the least $n$ for which every $k$-edge-coloured tournament on $n$ vertices contains a monochromatic copy of $H$. We prove that $ \\overrightarrow{R}(T,k) \\le c_k|T|^k$ for any oriented tree $T$. This is a generalisation of a similar result for directed paths by Chv\\'atal and by Gy\\'arf\\'as and Lehel, and answers a question of Yuster. In general, it is tight up to a constant factor.\n  We also consider the $k$-colour direc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04504","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":"1708.04504","created_at":"2026-05-17T23:47:12.824614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04504v2","created_at":"2026-05-17T23:47:12.824614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04504","created_at":"2026-05-17T23:47:12.824614+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2QY4LRYI7UU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2QY4LRYI7UU4I5O","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2QY4LRY","created_at":"2026-05-18T12:31:34.259226+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/O2QY4LRYI7UU4I5OYGQE6PBNZY","json":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY.json","graph_json":"https://pith.science/api/pith-number/O2QY4LRYI7UU4I5OYGQE6PBNZY/graph.json","events_json":"https://pith.science/api/pith-number/O2QY4LRYI7UU4I5OYGQE6PBNZY/events.json","paper":"https://pith.science/paper/O2QY4LRY"},"agent_actions":{"view_html":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY","download_json":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY.json","view_paper":"https://pith.science/paper/O2QY4LRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04504&json=true","fetch_graph":"https://pith.science/api/pith-number/O2QY4LRYI7UU4I5OYGQE6PBNZY/graph.json","fetch_events":"https://pith.science/api/pith-number/O2QY4LRYI7UU4I5OYGQE6PBNZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY/action/storage_attestation","attest_author":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY/action/author_attestation","sign_citation":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY/action/citation_signature","submit_replication":"https://pith.science/pith/O2QY4LRYI7UU4I5OYGQE6PBNZY/action/replication_record"}},"created_at":"2026-05-17T23:47:12.824614+00:00","updated_at":"2026-05-17T23:47:12.824614+00:00"}