{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6GWRPHYZC6DTWOVQYZQ25MHGLX","short_pith_number":"pith:6GWRPHYZ","schema_version":"1.0","canonical_sha256":"f1ad179f1917873b3ab0c661aeb0e65dc6f8525a767c480d6c7b09f87e8c9038","source":{"kind":"arxiv","id":"1002.0783","version":2},"attestation_state":"computed","paper":{"title":"Maximum $\\Delta$-edge-colorable subgraphs of class II graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eckhard Steffen, Vahan V. Mkrtchyan","submitted_at":"2010-02-03T16:26:25Z","abstract_excerpt":"A graph $G$ is class II, if its chromatic index is at least $\\Delta+1$. Let $H$ be a maximum $\\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\\frac{|E(H)|}{|E(G)|}$, and structural properties of maximum $\\Delta$-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with $\\Delta\\geq3$ can be extended to a maximum $\\Delta$-edge-colorable subgraph. Simple graphs have a maximum $\\Delta$-edge-colorable subgraph such that the complement is a matching. Furthermore, a maximum $\\Delta$-edge-colorable subgraph of a sim"},"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":"1002.0783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-02-03T16:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"8da45b061e6ba524e3053b94e85aa5ce5f685337e5d657c30dffc628dc70b835","abstract_canon_sha256":"af7a9fe22d619b1eec8dfa44817756593eb8afd0dd9f631d55e98bd323488fc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:24.206517Z","signature_b64":"2MSrPdv02FfT190okKJWb+45e0uHLEDFo5FMwWRCroptavIlDKAvL80NTrEPeUlsDGXJtF8JEmz1/FmbKB5UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ad179f1917873b3ab0c661aeb0e65dc6f8525a767c480d6c7b09f87e8c9038","last_reissued_at":"2026-05-18T03:42:24.206016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:24.206016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum $\\Delta$-edge-colorable subgraphs of class II graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eckhard Steffen, Vahan V. Mkrtchyan","submitted_at":"2010-02-03T16:26:25Z","abstract_excerpt":"A graph $G$ is class II, if its chromatic index is at least $\\Delta+1$. Let $H$ be a maximum $\\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\\frac{|E(H)|}{|E(G)|}$, and structural properties of maximum $\\Delta$-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with $\\Delta\\geq3$ can be extended to a maximum $\\Delta$-edge-colorable subgraph. Simple graphs have a maximum $\\Delta$-edge-colorable subgraph such that the complement is a matching. Furthermore, a maximum $\\Delta$-edge-colorable subgraph of a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0783","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":"1002.0783","created_at":"2026-05-18T03:42:24.206095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0783v2","created_at":"2026-05-18T03:42:24.206095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0783","created_at":"2026-05-18T03:42:24.206095+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GWRPHYZC6DT","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GWRPHYZC6DTWOVQ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GWRPHYZ","created_at":"2026-05-18T12:26:04.259169+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/6GWRPHYZC6DTWOVQYZQ25MHGLX","json":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX.json","graph_json":"https://pith.science/api/pith-number/6GWRPHYZC6DTWOVQYZQ25MHGLX/graph.json","events_json":"https://pith.science/api/pith-number/6GWRPHYZC6DTWOVQYZQ25MHGLX/events.json","paper":"https://pith.science/paper/6GWRPHYZ"},"agent_actions":{"view_html":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX","download_json":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX.json","view_paper":"https://pith.science/paper/6GWRPHYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0783&json=true","fetch_graph":"https://pith.science/api/pith-number/6GWRPHYZC6DTWOVQYZQ25MHGLX/graph.json","fetch_events":"https://pith.science/api/pith-number/6GWRPHYZC6DTWOVQYZQ25MHGLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX/action/storage_attestation","attest_author":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX/action/author_attestation","sign_citation":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX/action/citation_signature","submit_replication":"https://pith.science/pith/6GWRPHYZC6DTWOVQYZQ25MHGLX/action/replication_record"}},"created_at":"2026-05-18T03:42:24.206095+00:00","updated_at":"2026-05-18T03:42:24.206095+00:00"}