Combinatorics / CONCEPT
Complete multipartite graphs
Complete multipartite adjacency matrices and polynomial norms.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES4
PROOF DEPTH0
DOCUMENT LINKS0
Symmetry of adjacency
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Hermitian pencil crossingstructural-affinity · Closed
- Multipartite CHS recurrencestructural-affinity · Closed
- Multipartite coefficient extremastructural-affinity · Closed
- Non-backtracking Laplacian gapstructural-affinity · Closed
- PathCHSNormClosedFormstructural-affinity · Closed
- Spectral coefficients from part sizesstructural-affinity · Closed
- Stable synchronous iteration can become unstable with unit remote delaysstructural-affinity · Closed
- The binomial coefficient with an integer lower indexstructural-affinity · Closed
- The first bound of Miska–Ulas Conjecture 4.8 is falsestructural-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