trureturingGitHub MATHEMATICAL ATLAS

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 Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES0
PROOF DEPTH0
DOCUMENT LINKS1
THEOREM

Every upset is neighbourhood-convex

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Upsets in neighbourhood convex geometriesUpsets in neighbourhood convexgeometries
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.