{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z4LZLQG2NXSCVABBLQXQICPUAY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bbdc72f4571ed58b1881461670c20a02fe54ff7ea2f3f4575919fe171d8c452f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","title_canon_sha256":"6bf8559cdcf6c8d3b190d7d5d3edba3c94de05e0538bc341bc18cf0590a59516"},"schema_version":"1.0","source":{"id":"2606.28198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28198","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28198v1","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28198","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"Z4LZLQG2NXSC","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z4LZLQG2NXSCVABB","created_at":"2026-06-29T01:15:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z4LZLQG2","created_at":"2026-06-29T01:15:09Z"}],"graph_snapshots":[{"event_id":"sha256:242e509175021572a4c3736a10e21eec9cf04d7ceef7ebe5830d10fbb52c00c2","target":"graph","created_at":"2026-06-29T01:15:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28198/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is $\\tau_k$-maximal if $G$ contains no subgraph admitting $k+1$ edge-disjoint spanning trees, while the addition of any edge in the complement of $G$ yields a subgraph that admits $k+1$ edge-disjoint spanning trees. In this paper, we prove that for any integers $k\\geq 1$ and $n\\geq 2k+2$, every $\\tau_k$-maximal graph of order $n$ satisfies $|E(G)|\\leq (k+1)(n-1)-1$. Furthermore, we construct a family of $\\tau_k$-maximal graphs on $n\\ge 2k+2$ vertices that have exactly $(k+1)(n-1)-1$ edges, which establishes the tightness of the upper bound. Then we conjecture that every $\\tau_k$-ma","authors_text":"Qinglin Wang, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","title":"Extremal graphs with no subgraph admitting $k+1$ edge-disjoint spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28198","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:804d98d0d9d476ab6f6ca4470824a16bb4351020a12f6b54393d751ef690124e","target":"record","created_at":"2026-06-29T01:15:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bbdc72f4571ed58b1881461670c20a02fe54ff7ea2f3f4575919fe171d8c452f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T15:48:16Z","title_canon_sha256":"6bf8559cdcf6c8d3b190d7d5d3edba3c94de05e0538bc341bc18cf0590a59516"},"schema_version":"1.0","source":{"id":"2606.28198","kind":"arxiv","version":1}},"canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf1795c0da6de42a80215c2f0409f4063c3a34e274394c0f89c286d2d82d05b5","first_computed_at":"2026-06-29T01:15:09.016143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-29T01:15:09.016143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ycug+4WpaO62X0ZxDJk7XfEWuDGzH1o8ll8ISoAlpQbh8DFrhwkpLpNS1oNcl7FiNFUAf+DhpvVaKxnOELFqAg==","signature_status":"signed_v1","signed_at":"2026-06-29T01:15:09.017640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:804d98d0d9d476ab6f6ca4470824a16bb4351020a12f6b54393d751ef690124e","sha256:242e509175021572a4c3736a10e21eec9cf04d7ceef7ebe5830d10fbb52c00c2"],"state_sha256":"5422c487f8a8e0678797b9be5610626a4144206a41f6963da1b40996f26135d2"}