Combinatorics / CONCEPT
The spectral degree exponent fails submodularity
Five-vertex graphs refute edge-set submodularity of the spectral degree exponent.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
A five-vertex counterexample
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
- A disconnected counterexample to the token-radius conjecturestructural-affinity · Closed
- Bourin–Lee Conjecture 3.3structural-affinity · Closed
- HermitianCubeDerivativestructural-affinity · Closed
- HermitianHypersurfaceCalculusstructural-affinity · Closed
- New Laplacian layer maxima decrease on the four-vertex starstructural-affinity · Closed
- Quantitative edges of a positive and negative block spikestructural-affinity · Closed
- The token-graph cut bound fails on a five-cycle blow-upstructural-affinity · Closed
- Weil: Hermitian Pos Partstructural-affinity · Closed
- Weil: Rank Tracestructural-affinity · Closed
- Weil: Sylvesterstructural-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