Combinatorics / CONCEPT
Regular graph CHS extrema
Extrema of complete homogeneous symmetric norms over connected regular graphs.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES0
PROOF DEPTH13
DOCUMENT LINKS0
The cycle minimizes and the complete graph maximizes
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
- Closed walks in regular graphsstructural-affinity · Closed
- Cycle partitionsstructural-affinity · Closed
- Newtonstructural-affinity · Closed
- PathCHSNormBCSRemark43ClosedRefutationstructural-affinity · Closed
- PathCHSNormClosedFormstructural-affinity · Closed
- Spectral coefficients from part sizesstructural-affinity · Closed
- The actual defect family on a cyclestructural-affinity · Closed
- The cycle comparison boundstructural-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