{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BLAJ5HXHSVXJLLGBUCN3CWJNYQ","short_pith_number":"pith:BLAJ5HXH","schema_version":"1.0","canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","source":{"kind":"arxiv","id":"1509.05544","version":1},"attestation_state":"computed","paper":{"title":"Partitioning 2-edge-colored graphs by monochromatic paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Daniel Gerbner, Gabor N. Sarkozy, Janos Barat, Jozsef Balogh","submitted_at":"2015-09-18T08:34:23Z","abstract_excerpt":"We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\\'ark\\\"ozy: the vertex set of every $2$-edge-colored graph can be partitioned into at most $2\\alpha(G)$ monochromatic cycles, where $\\alpha(G)$ denotes the independence number of $G$. Another direction, emerged recently from a conjecture of Schelp, is to consider colorings of graphs with given minimum degree. We prove that apart from $o(|V(G)|)$ vertices, the vertex set of any $2$-edge-colored graph $G$ with minimum degre"},"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":"1509.05544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"1718983b237f78483c6620a04fe723f3fc17ceaac086c284611bdb89300e9a95","abstract_canon_sha256":"6877491d520e9fa5dfb4522a7d63ae2df0fe3c57255b9cef31fba7d02d0031f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.882355Z","signature_b64":"cX+7kFyV/6tMbGaY+BbM0lhLU+wM5FoNw3X5DrImvIPx0x4TXtk4WIoRP5uksBOTtIR4hWzB9YFZziS5eVdBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac09e9ee7956e95acc1a09bb1592dc41d784fcac1b6d47b84a2f86ee73a10fa","last_reissued_at":"2026-05-18T01:32:42.881875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.881875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning 2-edge-colored graphs by monochromatic paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Daniel Gerbner, Gabor N. Sarkozy, Janos Barat, Jozsef Balogh","submitted_at":"2015-09-18T08:34:23Z","abstract_excerpt":"We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\\'ark\\\"ozy: the vertex set of every $2$-edge-colored graph can be partitioned into at most $2\\alpha(G)$ monochromatic cycles, where $\\alpha(G)$ denotes the independence number of $G$. Another direction, emerged recently from a conjecture of Schelp, is to consider colorings of graphs with given minimum degree. We prove that apart from $o(|V(G)|)$ vertices, the vertex set of any $2$-edge-colored graph $G$ with minimum degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05544","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":"1509.05544","created_at":"2026-05-18T01:32:42.881960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05544v1","created_at":"2026-05-18T01:32:42.881960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05544","created_at":"2026-05-18T01:32:42.881960+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLAJ5HXHSVXJ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLAJ5HXHSVXJLLGB","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLAJ5HXH","created_at":"2026-05-18T12:29:14.074870+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/BLAJ5HXHSVXJLLGBUCN3CWJNYQ","json":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ.json","graph_json":"https://pith.science/api/pith-number/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/graph.json","events_json":"https://pith.science/api/pith-number/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/events.json","paper":"https://pith.science/paper/BLAJ5HXH"},"agent_actions":{"view_html":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ","download_json":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ.json","view_paper":"https://pith.science/paper/BLAJ5HXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05544&json=true","fetch_graph":"https://pith.science/api/pith-number/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/action/storage_attestation","attest_author":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/action/author_attestation","sign_citation":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/action/citation_signature","submit_replication":"https://pith.science/pith/BLAJ5HXHSVXJLLGBUCN3CWJNYQ/action/replication_record"}},"created_at":"2026-05-18T01:32:42.881960+00:00","updated_at":"2026-05-18T01:32:42.881960+00:00"}