trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Adjacent supports and harmonic payment

For a connected finite simple graph with maximum degree at most four and at most one original leaf neighbor per vertex, deleting two adjacent nonleaf supports with original pendant neighbors decreases the rational harmonic index by at least 21/20. All degrees in the remaining graph are recomputed, and original pendant edges at retained vertices contribute their actual defect changes.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES0
PROOF DEPTH0
DOCUMENT LINKS1
THEOREM

The simultaneous payment estimate

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Adjacent supports and harmonic paymentAdjacent supports and harmonicpayment
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

None recorded in this release.

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

RELATED KNOWLEDGE

Structural connections

None recorded in this release.

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

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.