Problem packetResearch packetR394
The n=6 forbidden graph has total domination number 12
Link to a section
The record reports a computation within its stated scope.
Recorded status: supported
Recorded scope: total domination and the resulting integral connectivity lower bound for VR(Q_6;4)
Complete recorded scope and conditions
{
"kind": "bounded",
"statement": "total domination and the resulting integral connectivity lower bound for VR(Q_6;4)",
"bounds": {
"cube_dimension": {
"min": 6,
"max": 6
},
"scale": {
"min": 4,
"max": 4
},
"total_domination_number": {
"min": 12,
"max": 12
},
"certified_connectivity": {
"min": 4,
"max": 4
}
},
"exhaustive": true
}Originating problem: Integral torsion in scale-four hypercube Rips complexes
Recorded relationships: Torsion-free through n=5 and no 2-primary torsion at n=6
Authored record and scope
- Authored title
- The n=6 forbidden graph has total domination number 12
- Record type
- claim
- Stored status
- supported
- Evidence grade
- computational
- Recorded scope data
- { "kind": "bounded", "statement": "total domination and the resulting integral connectivity lower bound for VR(Q_6;4)", "bounds": { "cube_dimension": { "min": 6, "max": 6 }, "scale": { "min": 4, "max": 4 }, "total_domination_number": { "min": 12, "max": 12 }, "certified_connectivity": { "min": 4, "max": 4 } }, "exhaustive": true }
- Linked research record IDs
- R388
2Authored explanation
Under the graph reduction in this packet, \(\operatorname{VR}(Q_6;4)=I(G)\), where \(G\) is the 64-vertex graph \(Q_6\) with antipodal matching. The exact set-cover artifact proves \[ \gamma_t(G)=12. \] Theorem 2.3 quoted by Bendersky, Elia, and Grbić states that if \(\gamma_t(G)>2k\), then \(I(G)\) is \((k-1)\)-connected. Taking \(k=5\) gives 4-connectivity because \(12>10\).
This result proves integral homology vanishes through degree 4. It falls short of the degree-6 vanishing asserted elsewhere from a mod-two computation.
Continue this work
Replay material: source only
3Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, Bendersky, Elia, and Grbić, Theorem 2.3; exact gamma_t computation in hr4-artifact-total-domination-twelve
4What was measured
Execution
5How it connects
Evidenced by
- artifact
Strengthens
- claim
Used by
- attempt
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R394",
"content_hash": null,
"slug": "hr4-claim-total-domination-twelve",
"type": "claim",
"title": "The n=6 forbidden graph has total domination number 12",
"summary": "The exact value gamma_t=12 improves the published degree-only connectivity certificate: the cited Chudnovsky-Meshulam total-domination theorem proves that VR(Q_6;4) is 4-connected.",
"relevance": "For Integral torsion in scale-four hypercube Rips complexes, record hr4-claim-total-domination-twelve (“The n=6 forbidden graph has total domination number 12”) records a bound, answer, status fact, or structural consequence. The record states: The exact value gamma_t=12 improves the published degree-only connectivity certificate: the cited Chudnovsky-Meshulam total-domination theorem proves that VR(Q_6;4) is 4-connected.",
"relevance_source": "recorded",
"body": "Under the graph reduction in this packet, \\(\\operatorname{VR}(Q_6;4)=I(G)\\), where \\(G\\) is the 64-vertex graph \\(Q_6\\) with antipodal matching. The exact set-cover artifact proves\n\\[\n\\gamma_t(G)=12.\n\\]\nTheorem 2.3 quoted by Bendersky, Elia, and Grbić states that if \\(\\gamma_t(G)>2k\\), then \\(I(G)\\) is \\((k-1)\\)-connected. Taking \\(k=5\\) gives 4-connectivity because \\(12>10\\).\n\nThis result proves integral homology vanishes through degree 4. It falls short of the degree-6 vanishing asserted elsewhere from a mod-two computation.",
"status": "supported",
"evidence_grade": "computational",
"scope": {
"kind": "bounded",
"statement": "total domination and the resulting integral connectivity lower bound for VR(Q_6;4)",
"bounds": {
"cube_dimension": {
"min": 6,
"max": 6
},
"scale": {
"min": 4,
"max": 4
},
"total_domination_number": {
"min": 12,
"max": 12
},
"certified_connectivity": {
"min": 4,
"max": 4
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://arxiv.org/abs/2605.00705",
"locator": "Bendersky, Elia, and Grbić, Theorem 2.3; exact gamma_t computation in hr4-artifact-total-domination-twelve"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/2605.00705",
"locator": "Bendersky, Elia, and Grbić, Theorem 2.3; exact gamma_t computation in hr4-artifact-total-domination-twelve"
},
"models": [],
"relations": [
{
"slug": "R382",
"title": "Exact total-domination search for the n=6 forbidden graph",
"object_type": "artifact",
"relation": "evidences",
"direction": "incoming"
},
{
"slug": "R388",
"title": "Torsion-free through n=5 and no 2-primary torsion at n=6",
"object_type": "claim",
"relation": "strengthens",
"direction": "outgoing"
},
{
"slug": "R386",
"title": "Total domination cannot certify 6-connectivity at n=6",
"object_type": "attempt",
"relation": "uses",
"direction": "incoming"
},
{
"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
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.