{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HJ6PKNH3HRY7JUOG5O6JGDY5BI","short_pith_number":"pith:HJ6PKNH3","schema_version":"1.0","canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","source":{"kind":"arxiv","id":"1702.00973","version":1},"attestation_state":"computed","paper":{"title":"A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Joshua Erde, Konstantinos Stavropoulos, Martin Merker, Max Pitz, Nathan Bowler","submitted_at":"2017-02-03T11:35:44Z","abstract_excerpt":"A \\emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \\emph{dynamic colouring number} $\\chi_2(G)$ of a graph $G$ is the least number of colours needed for a dynamic colouring of $G$.\n  Montgomery conjectured that $\\chi_2(G) \\leq \\chi(G) + 2$ for all regular graphs $G$, which would significantly improve the best current upper bound $\\chi_2(G) \\leq 2\\chi(G)$. In this note, however, we show that this last upper bound is sharp by constructing, for every integer $n \\geq 2$, a regular graph $G$ with $\\chi(G) = n$ but $\\chi_2("},"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":"1702.00973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T11:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"4f82a479319644a812a5bd555c0dc9a585333c55ef1ab85aba519a0921054467","abstract_canon_sha256":"21b63956526dfff566015cdd1bf1f61b9f68aab7b9aa6423d6248b13f214bd71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.265798Z","signature_b64":"V3r1kxUIkXBz04XNKM2jT5m4z44Vx3Zgx1oRISiSrKyqqdt3zNHHejsJ/9Vuq+Db94hkSnxcQgJHkDvE1rpVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","last_reissued_at":"2026-05-18T00:51:29.265206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.265206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Joshua Erde, Konstantinos Stavropoulos, Martin Merker, Max Pitz, Nathan Bowler","submitted_at":"2017-02-03T11:35:44Z","abstract_excerpt":"A \\emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \\emph{dynamic colouring number} $\\chi_2(G)$ of a graph $G$ is the least number of colours needed for a dynamic colouring of $G$.\n  Montgomery conjectured that $\\chi_2(G) \\leq \\chi(G) + 2$ for all regular graphs $G$, which would significantly improve the best current upper bound $\\chi_2(G) \\leq 2\\chi(G)$. In this note, however, we show that this last upper bound is sharp by constructing, for every integer $n \\geq 2$, a regular graph $G$ with $\\chi(G) = n$ but $\\chi_2("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00973","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":"1702.00973","created_at":"2026-05-18T00:51:29.265291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00973v1","created_at":"2026-05-18T00:51:29.265291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00973","created_at":"2026-05-18T00:51:29.265291+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJ6PKNH3HRY7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJ6PKNH3HRY7JUOG","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJ6PKNH3","created_at":"2026-05-18T12:31:18.294218+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/HJ6PKNH3HRY7JUOG5O6JGDY5BI","json":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI.json","graph_json":"https://pith.science/api/pith-number/HJ6PKNH3HRY7JUOG5O6JGDY5BI/graph.json","events_json":"https://pith.science/api/pith-number/HJ6PKNH3HRY7JUOG5O6JGDY5BI/events.json","paper":"https://pith.science/paper/HJ6PKNH3"},"agent_actions":{"view_html":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI","download_json":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI.json","view_paper":"https://pith.science/paper/HJ6PKNH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00973&json=true","fetch_graph":"https://pith.science/api/pith-number/HJ6PKNH3HRY7JUOG5O6JGDY5BI/graph.json","fetch_events":"https://pith.science/api/pith-number/HJ6PKNH3HRY7JUOG5O6JGDY5BI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/action/storage_attestation","attest_author":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/action/author_attestation","sign_citation":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/action/citation_signature","submit_replication":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/action/replication_record"}},"created_at":"2026-05-18T00:51:29.265291+00:00","updated_at":"2026-05-18T00:51:29.265291+00:00"}