Combinatorics / CONCEPT
The Pair before the Terminal Configuration
Avoidance and a cyclic successor determine two additional suffix entries.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH5
DOCUMENT LINKS1
Two forced suffix entries
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- An Extreme Value in the Inverse Imagestructural-affinity · Closed
- An Upward Edge and a Later Intermediate Valuestructural-affinity · Closed
- Incompatible Middle Cycle Datastructural-affinity · Closed
- Incompatible Terminal Entriesstructural-affinity · Closed
- Size Bound for Indecomposable Fixed 312-Avoidersstructural-affinity · Closed
- The Entry Following the Maximumstructural-affinity · Closed
- The Initial Pair after the Maximum and Onestructural-affinity · Closed
- The Penultimate Record Blockstructural-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