{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZFB63HBBG3MDMD7QYF3X6BQB7O","short_pith_number":"pith:ZFB63HBB","schema_version":"1.0","canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","source":{"kind":"arxiv","id":"1412.7798","version":1},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s-Gallai-type results for colorful monochromatic connectivity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Qingqiong Cai, Xueliang Li","submitted_at":"2014-12-25T06:57:21Z","abstract_excerpt":"A path in an edge-colored graph is called a \\emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \\emph{monochromatic connection coloring} (MC-coloring, for short) if there is a monochromatic path joining any two vertices in $G$. The \\emph{monochromatic connection number}, denoted by $mc(G)$, is defined to be the maximum number of colors used in an MC-coloring of a graph $G$. These concepts were introduced by Caro and Yuster, and they got some nice results. In this paper, we will study two kinds of Erd\\H{o}s-Gallai-type problems for $mc(G)$, "},"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":"1412.7798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-25T06:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a115a7b8d369a28ee4d170cd06d345d341b28ceb7bd92b0e80675b6d9ae48b6","abstract_canon_sha256":"af9a91095936509530f07f198997dc2adb9381a08bc34b3f495af76a1aa416e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:25.121587Z","signature_b64":"DDZbvxS/6khvFNXL2uRCsHLpwWCjkd1kbeu1Z88R2Dz6ZROgoknDGRmhI4OVFkSFIWMF+eAeR5TP8bh3C/GGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","last_reissued_at":"2026-05-18T02:30:25.121198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:25.121198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Gallai-type results for colorful monochromatic connectivity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Qingqiong Cai, Xueliang Li","submitted_at":"2014-12-25T06:57:21Z","abstract_excerpt":"A path in an edge-colored graph is called a \\emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \\emph{monochromatic connection coloring} (MC-coloring, for short) if there is a monochromatic path joining any two vertices in $G$. The \\emph{monochromatic connection number}, denoted by $mc(G)$, is defined to be the maximum number of colors used in an MC-coloring of a graph $G$. These concepts were introduced by Caro and Yuster, and they got some nice results. In this paper, we will study two kinds of Erd\\H{o}s-Gallai-type problems for $mc(G)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7798","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":"1412.7798","created_at":"2026-05-18T02:30:25.121249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7798v1","created_at":"2026-05-18T02:30:25.121249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7798","created_at":"2026-05-18T02:30:25.121249+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFB63HBBG3MD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFB63HBBG3MDMD7Q","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFB63HBB","created_at":"2026-05-18T12:28:59.999130+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/ZFB63HBBG3MDMD7QYF3X6BQB7O","json":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O.json","graph_json":"https://pith.science/api/pith-number/ZFB63HBBG3MDMD7QYF3X6BQB7O/graph.json","events_json":"https://pith.science/api/pith-number/ZFB63HBBG3MDMD7QYF3X6BQB7O/events.json","paper":"https://pith.science/paper/ZFB63HBB"},"agent_actions":{"view_html":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O","download_json":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O.json","view_paper":"https://pith.science/paper/ZFB63HBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7798&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFB63HBBG3MDMD7QYF3X6BQB7O/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFB63HBBG3MDMD7QYF3X6BQB7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/action/storage_attestation","attest_author":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/action/author_attestation","sign_citation":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/action/citation_signature","submit_replication":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/action/replication_record"}},"created_at":"2026-05-18T02:30:25.121249+00:00","updated_at":"2026-05-18T02:30:25.121249+00:00"}