trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Rank from Maximum Matchings without Even Simple Cycles

Over every characteristic-two field, a symmetric zero-diagonal matrix whose support graph has no even simple cycle has rank twice its maximum matching cardinality.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
THEOREM

Rank Equals Twice the Maximum Matching Size

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Rank from Maximum Matchings without Even Simple CyclesRank from Maximum Matchingswithout Even Simple CyclesRanks of Weighted Paths and CyclesRanks of Weighted Paths andCycles
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

None recorded in this release.

Certified topology / DOWNSTREAM

Consequences

RELATED KNOWLEDGE

Structural connections

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 archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
0
Layer
D5/S3
Domain
Combinatorics
Node ID
D5/S3/Combinatorics/Graph/Walks/NoEvenCycleRank
Repository path
D5/S3/Combinatorics/Graph/Walks/NoEvenCycleRank.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.