Observer / CONCEPT
An Actual Boolean K4 Subdivision and Its Exact Certificate
An actual Boolean rank-three K4 certificate refutes the necessary two-degree-four shape.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
The positive certificate refutes the degree consequence
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A Rank-Three Protocol Beyond Balanced Deletionstructural-affinity · Closed
- Boolean Tasks and the Complete Rank-Three Odd Fiberstructural-affinity · Closed
- Boolean Tasks at Cyclomatic Rank Fourstructural-affinity · Closed
- Bounded Cuts and Unbounded Three-Leaf Causal Peakstructural-affinity · Closed
- Edge Connectivity and Binary Gradient Decodingstructural-affinity · Closed
- Edge Connectivity and Binary Gradient Weightstructural-affinity · Closed
- Exact Boolean Budgets at Low Cycle Rankstructural-affinity · Closed
- ModuleCat Homology of a Binary Graph Cycle Spacestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance