Combinatorics / CONCEPT
Real-rooted general position polynomials
A finite nonempty connected graph has a real-rooted general position polynomial exactly when it is complete.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
Real-rootedness is equivalent to completeness
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
- Finite posterior exponential momentsstructural-affinity · Closed
- Finite weighted subset lawsstructural-affinity · Closed
- Log-concavity of the full crown f-vectorstructural-affinity · Closed
- Matching-twisted clique cyclesstructural-affinity · Closed
- Mobile general position on two exceptional cylindersstructural-affinity · Closed
- Newton inequalities from the upstream symmetric-function proofstructural-affinity · Closed
- Theta graph structure and metric dimensionstructural-affinity · Closed
- Uniform Posterior Log Oddsstructural-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