Combinatorics / CONCEPT
Upsets in neighbourhood convex geometries
Let V be any finite nonempty vertex set and G any simple undirected graph on V. Closed neighbourhoods include their centre. No connectivity, absence of universal vertices, or distinction of equal neighbourhoods is assumed.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES0
PROOF DEPTH0
DOCUMENT LINKS1
Every upset is neighbourhood-convex
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
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 archiveCertified provenance