{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AGZEWXX45V3WJJV3FNPLFUMYZG","short_pith_number":"pith:AGZEWXX4","schema_version":"1.0","canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","source":{"kind":"arxiv","id":"1901.09412","version":1},"attestation_state":"computed","paper":{"title":"Singular Ramsey and Tur\\'an numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yair Caro, Zsolt Tuza","submitted_at":"2019-01-27T18:09:15Z","abstract_excerpt":"We say that a subgraph $F$ of a graph $G$ is singular if the degrees $d_G(v)$ are all equal or all distinct for the vertices $v\\in V(F)$. The singular Ramsey number Rs$(F)$ is the smallest positive integer $n$ such that, for every $m\\geq n$, in every edge 2-coloring of $K_m$, at least one of the color classes contains $F$ as a singular subgraph. In a similar flavor, the singular Tur\\'an number Ts$(n,F)$ is defined as the maximum number of edges in a graph of order $n$, which does not contain $F$ as a singular subgraph. In this paper we initiate the study of these extremal problems. We develop "},"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":"1901.09412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T18:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"59b891e7e8bab083998303d35579fe2a7cb2d72d38dd1b0e0ce7b43acde94aa2","abstract_canon_sha256":"7f007782f6174311cd3ca166bc09ff88dfe0eaf0e4c9031d952e57241c2c1061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:24.874789Z","signature_b64":"JFTIEbTsgeclJM+z2D711JJQ+CqkEKTrXNGd7cnpv8Uuad6mrSnmBerYBoGuEifo5/HDOeBTQNhiQ/O6Ud+HDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b24b5efced7764a6bb2b5eb2d198c98e7b28273267752919f4a3420b2c5883","last_reissued_at":"2026-05-17T23:55:24.874303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:24.874303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Singular Ramsey and Tur\\'an numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yair Caro, Zsolt Tuza","submitted_at":"2019-01-27T18:09:15Z","abstract_excerpt":"We say that a subgraph $F$ of a graph $G$ is singular if the degrees $d_G(v)$ are all equal or all distinct for the vertices $v\\in V(F)$. The singular Ramsey number Rs$(F)$ is the smallest positive integer $n$ such that, for every $m\\geq n$, in every edge 2-coloring of $K_m$, at least one of the color classes contains $F$ as a singular subgraph. In a similar flavor, the singular Tur\\'an number Ts$(n,F)$ is defined as the maximum number of edges in a graph of order $n$, which does not contain $F$ as a singular subgraph. In this paper we initiate the study of these extremal problems. We develop "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09412","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":"1901.09412","created_at":"2026-05-17T23:55:24.874401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09412v1","created_at":"2026-05-17T23:55:24.874401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09412","created_at":"2026-05-17T23:55:24.874401+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGZEWXX45V3W","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGZEWXX45V3WJJV3","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGZEWXX4","created_at":"2026-05-18T12:33:12.712433+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/AGZEWXX45V3WJJV3FNPLFUMYZG","json":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG.json","graph_json":"https://pith.science/api/pith-number/AGZEWXX45V3WJJV3FNPLFUMYZG/graph.json","events_json":"https://pith.science/api/pith-number/AGZEWXX45V3WJJV3FNPLFUMYZG/events.json","paper":"https://pith.science/paper/AGZEWXX4"},"agent_actions":{"view_html":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG","download_json":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG.json","view_paper":"https://pith.science/paper/AGZEWXX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09412&json=true","fetch_graph":"https://pith.science/api/pith-number/AGZEWXX45V3WJJV3FNPLFUMYZG/graph.json","fetch_events":"https://pith.science/api/pith-number/AGZEWXX45V3WJJV3FNPLFUMYZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/action/storage_attestation","attest_author":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/action/author_attestation","sign_citation":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/action/citation_signature","submit_replication":"https://pith.science/pith/AGZEWXX45V3WJJV3FNPLFUMYZG/action/replication_record"}},"created_at":"2026-05-17T23:55:24.874401+00:00","updated_at":"2026-05-17T23:55:24.874401+00:00"}