{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FYOV7HY662OLKDJPKJPQAOU67T","short_pith_number":"pith:FYOV7HY6","schema_version":"1.0","canonical_sha256":"2e1d5f9f1ef69cb50d2f525f003a9efcfdadd689faeac30e519ad0a05d07b773","source":{"kind":"arxiv","id":"1506.04495","version":1},"attestation_state":"computed","paper":{"title":"Replacing the host K_n by n-chromatic graphs in Ramsey-type results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Arie Bialostocki","submitted_at":"2015-06-15T07:32:44Z","abstract_excerpt":"We extend two well-known results in Ramsey theory from from $K_n$ to arbitrary $n$-chromatic graphs. The first is a note of Erd\\H os and Rado stating that in every 2-coloring of the edges of $K_n$ there is a monochromatic tree on $n$ vertices. The second is the theorem of Cockayne and Lorimer stating that for positive integers satisfying $n_1=\\max\\{n_1,n_2,\\dots,n_t\\}$ and with $n=n_1+1+\\sum_{i=1}^t (n_i-1)$, the following holds. In every coloring of the edges of $K_n$ with colors $1,2\\dots,t$ there is a monochromatic matching of size $n_i$ for some $i\\in \\{1,2,\\dots,t\\}$."},"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":"1506.04495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-15T07:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"df06833b6c2e4a0921bbd4a6c50fb361af2295f08079ca93adf3f6fe3ea96096","abstract_canon_sha256":"aa85a4b591a880693061effa62f5535cd0ff055eb48688b3b4939962dab6ea9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:54.448060Z","signature_b64":"neN5oLjAnZLbM+HO3V2SsF2rBbVLK2HBNr1qne9w1TwfdbLGv3dqeQoQ7zMPprnW6k7CZ3vKRafNkEmpOmBRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e1d5f9f1ef69cb50d2f525f003a9efcfdadd689faeac30e519ad0a05d07b773","last_reissued_at":"2026-05-18T01:49:54.447557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:54.447557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Replacing the host K_n by n-chromatic graphs in Ramsey-type results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Arie Bialostocki","submitted_at":"2015-06-15T07:32:44Z","abstract_excerpt":"We extend two well-known results in Ramsey theory from from $K_n$ to arbitrary $n$-chromatic graphs. The first is a note of Erd\\H os and Rado stating that in every 2-coloring of the edges of $K_n$ there is a monochromatic tree on $n$ vertices. The second is the theorem of Cockayne and Lorimer stating that for positive integers satisfying $n_1=\\max\\{n_1,n_2,\\dots,n_t\\}$ and with $n=n_1+1+\\sum_{i=1}^t (n_i-1)$, the following holds. In every coloring of the edges of $K_n$ with colors $1,2\\dots,t$ there is a monochromatic matching of size $n_i$ for some $i\\in \\{1,2,\\dots,t\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04495","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":"1506.04495","created_at":"2026-05-18T01:49:54.447639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04495v1","created_at":"2026-05-18T01:49:54.447639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04495","created_at":"2026-05-18T01:49:54.447639+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYOV7HY662OL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYOV7HY662OLKDJP","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYOV7HY6","created_at":"2026-05-18T12:29:22.688609+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/FYOV7HY662OLKDJPKJPQAOU67T","json":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T.json","graph_json":"https://pith.science/api/pith-number/FYOV7HY662OLKDJPKJPQAOU67T/graph.json","events_json":"https://pith.science/api/pith-number/FYOV7HY662OLKDJPKJPQAOU67T/events.json","paper":"https://pith.science/paper/FYOV7HY6"},"agent_actions":{"view_html":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T","download_json":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T.json","view_paper":"https://pith.science/paper/FYOV7HY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04495&json=true","fetch_graph":"https://pith.science/api/pith-number/FYOV7HY662OLKDJPKJPQAOU67T/graph.json","fetch_events":"https://pith.science/api/pith-number/FYOV7HY662OLKDJPKJPQAOU67T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T/action/storage_attestation","attest_author":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T/action/author_attestation","sign_citation":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T/action/citation_signature","submit_replication":"https://pith.science/pith/FYOV7HY662OLKDJPKJPQAOU67T/action/replication_record"}},"created_at":"2026-05-18T01:49:54.447639+00:00","updated_at":"2026-05-18T01:49:54.447639+00:00"}