Combinatorics / CONCEPT
A nearly empty Cartesian layer
Deleting a vertex permits a maximum-degree coloring, which limits one row of a maximal independent set to a singleton.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
The connected nearly-empty-layer bound
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
- A Good Triple from a Two-Vertex Cutstructural-affinity · Closed
- An empty Cartesian layerstructural-affinity · Closed
- Characterizing well-covered Cayley squaresstructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Components and Vertex Cutsstructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Greedy Coloring and Vertex Extensionsstructural-affinity · Closed
- Independence in Cartesian Cayley squaresstructural-affinity · Closed
- Subcubic Brooks Theoremstructural-affinity · Closed
- Well-covered powers with unbounded diameterstructural-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