trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Dyson and McKay's cycle-clique optimality

The cycle-clique unions of Dyson and McKay attain the largest possible order without a regular induced subgraph of prime order p for every prime p at least thirteen.

Closed Authored exposition
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
THEOREM

The exact optimum for every prime at least thirteen

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
The extremal lower-bound constructionsThe extremal lower-boundconstructionsThe upper-bound optimizationThe upper-bound optimizationDyson and McKay's cycle-clique optimalityDyson and McKay's cycle-cliqueoptimality
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
3
Layer
D5/S3
Domain
Combinatorics
Node ID
D5/S3/Combinatorics/RegularInduced/DysonMcKay
Repository path
D5/S3/Combinatorics/RegularInduced/DysonMcKay.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.