Combinatorics / CONCEPT
Integer {2}-domination of three-row grids
The integer {2}-domination number of the three-row Cartesian grid is ⌊3n/2⌋ + 1 for every positive n. A potential on pairs of three-entry columns gives the lower bound, and alternating columns attain it.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
Domination as column inequalities
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 Tree Exceeds the Path in the Cordiality Gamestructural-affinity · Closed
- Digit-Sum Arcs: Infinitude and Natural Densitystructural-affinity · Closed
- Gupta's rectangular-grid dispersion inequalitystructural-affinity · Closed
- The 2-neighbour bootstrap percolation number of C_n x P_m is nstructural-affinity · Closed
- The Least Base Maximizing the Digit Sum Is the First Base Above Halfstructural-affinity · Closed
- Weak products do not preserve edge-complexity equalitystructural-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