Combinatorics / CONCEPT
Andrasfai mutual-visibility obstructions
Cyclic obstructions for original-host mutual visibility in the Andrasfai graphs.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
Exact obstruction characterization
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
- Actual membership words and cyclic boundariesstructural-affinity · Closed
- Actual subset counts and Howroyd's generating identitystructural-affinity · Closed
- CleanRootsstructural-affinity · Closed
- Counting based labelled closed runsstructural-affinity · Closed
- CyclicIntervalsstructural-affinity · Closed
- Enumeration prerequisites for the original identitystructural-affinity · Closed
- PairPaymentsstructural-affinity · Closed
- Rooted original-geodesic geometrystructural-affinity · Closed
- Separators and reachability in one surviving graphstructural-affinity · Closed
- SingletonCorestructural-affinity · Closed
- The Andrasfai forbidden languagestructural-affinity · Closed
- The corrected transfer-trace seriesstructural-affinity · Closed
- The source model and separator conventionsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance