[#R386] Total domination cannot certify 6-connectivity at n=6
1Summary
The attractive total-domination route stops at 4-connectivity because the exact invariant is 12. The cited theorem would require gamma_t greater than 14 to certify 6-connectivity.
The action was to compute \(\gamma_t\) exactly and feed it into the total-domination connectivity theorem. The search examined every candidate size allowed by the elementary lower bound until it found the optimum 12.
To obtain 6-connectivity from Theorem 2.3, set \(k=7\). Its strict hypothesis becomes \(\gamma_t(G)>14\). The exact value 12 violates that hypothesis. The same theorem certifies 4-connectivity and cannot certify 5-connectivity, whose hypothesis would be \(\gamma_t(G)>12\).
Ruled out evidence. Recorded scope: the total-domination method applied to 6-connectivity of VR(Q_6;4).
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, Theorem 2.3 and exact total-domination artifact in this packet
3Overview
This failure boundary is exact. Improving the total-domination search or finding a different minimum witness cannot extend this theorem's result for the same graph. Another topological argument is required.
4What was measured
- Method
- total domination connectivity bound
- Observed total domination number
- 12
- Target connectivity
- 6
- Required strict lower bound
- 14
- Stopping rule
- start at the covering lower bound, close each smaller exact search, and stop at the first verified total dominating set; no node or time cutoff
- Reusable boundary
- The theorem can certify only 4-connectivity for this graph.
- Retry condition
- Retry only with a different connectivity theorem or a graph invariant stronger than total domination.
Execution
5How it connects
Evidenced by
- artifact
Uses
- claim
Attempts
- claim
Recorded for
- problem
6Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R386",
"content_hash": null,
"slug": "hr4-attempt-total-domination-six-connectivity",
"type": "attempt",
"title": "Total domination cannot certify 6-connectivity at n=6",
"summary": "The attractive total-domination route stops at 4-connectivity because the exact invariant is 12. The cited theorem would require gamma_t greater than 14 to certify 6-connectivity.",
"relevance": "For Integral torsion in scale-four hypercube Rips complexes, record hr4-attempt-total-domination-six-connectivity (“Total domination cannot certify 6-connectivity at n=6”) documents a concrete method, search boundary, or failed route. The record states: The attractive total-domination route stops at 4-connectivity because the exact invariant is 12.",
"relevance_source": "recorded",
"body": "The action was to compute \\(\\gamma_t\\) exactly and feed it into the total-domination connectivity theorem. The search examined every candidate size allowed by the elementary lower bound until it found the optimum 12.\n\nTo obtain 6-connectivity from Theorem 2.3, set \\(k=7\\). Its strict hypothesis becomes \\(\\gamma_t(G)>14\\). The exact value 12 violates that hypothesis. The same theorem certifies 4-connectivity and cannot certify 5-connectivity, whose hypothesis would be \\(\\gamma_t(G)>12\\).\n\nThis failure boundary is exact. Improving the total-domination search or finding a different minimum witness cannot extend this theorem's result for the same graph. Another topological argument is required.",
"status": "failed",
"evidence_grade": "computational",
"scope": {
"kind": "bounded",
"statement": "the total-domination method applied to 6-connectivity of VR(Q_6;4)",
"bounds": {
"cube_dimension": {
"min": 6,
"max": 6
},
"scale": {
"min": 4,
"max": 4
},
"target_connectivity": {
"min": 6,
"max": 6
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://arxiv.org/abs/2605.00705",
"locator": "Theorem 2.3 and exact total-domination artifact in this packet"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/2605.00705",
"locator": "Theorem 2.3 and exact total-domination artifact in this packet"
},
"relations": [
{
"slug": "R382",
"title": "Exact total-domination search for the n=6 forbidden graph",
"object_type": "artifact",
"relation": "evidences",
"direction": "incoming"
},
{
"slug": "R394",
"title": "The n=6 forbidden graph has total domination number 12",
"object_type": "claim",
"relation": "uses",
"direction": "outgoing"
},
{
"slug": "R388",
"title": "Torsion-free through n=5 and no 2-primary torsion at n=6",
"object_type": "claim",
"relation": "attempts",
"direction": "outgoing"
},
{
"slug": "hypercube-rips-scale-four-torsion-free",
"title": "hypercube rips scale four torsion free",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
- Project
- hypercube-rips-scale-four-torsion-free-research
- Locator
- Theorem 2.3 and exact total-domination artifact in this packet
- License
- CC0-1.0
- Source
- arxiv.org ↗
- Public record
- R386
- Stable alias
- hr4-attempt-total-domination-six-connectivity
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.