Combinatorics / CONCEPT
Forced edges in generic patterns
Finite position and cutoff data reconstruct the labelled source graphs and give unique generic completions.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
The forced generic edge criterion
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Exact finite-support normalization and binomial countingstructural-affinity · Closed
- Exact source reconstruction and coordinate countingstructural-affinity · Closed
- Expansion and cutoff structure of ordered closurestructural-affinity · Closed
- The counted point-to-edge bridgestructural-affinity · Closed
- The rational counting polynomial on every original rankstructural-affinity · Closed
- The top coefficient and the complete Mazorchuk–Xu conjecturestructural-affinity · Closed
- Triangular subsets and ordered closurestructural-affinity · Closed
- Weak coordinate patterns and literal graph realizationstructural-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