Combinatorics / CONCEPT
Clique color extensions
A coloring outside a maximum-size clique with one missing edge extends across that copy; clique colorings can also avoid nonconstant prescribed outside colors.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
Extending over a clique with one missing edge
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
- Brooks' theorem and connected exceptionsstructural-affinity · Closed
- Clique and odd-cycle surgerystructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Components and Vertex Cutsstructural-affinity · Closed
- Cycle partitionsstructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Greedy Coloring and Vertex Extensionsstructural-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