MutualVisibility

Navigation page for Blueprint/D5/S3/Combinatorics/Graph/MutualVisibility/ at upstream snapshot 880384c42100f2d04436d97c4ac862e91b4bba85.

Contents

• Andrasfai mutual-visibility obstructions
• Actual subset counts and Howroyd’s generating identity
• Counting based labelled closed runs
• Enumeration prerequisites for the original identity
• The Andrasfai forbidden language
• The corrected transfer-trace series
• Actual membership words and cyclic boundaries
• CleanRoots
• Separators and reachability in one surviving graph
• CyclicIntervals
• Rooted original-geodesic geometry
• MinimumPair
• The source model and separator conventions
• PairPayments
• RootComparability
• SingletonCore