A “simple” rectangular puzzle

DOI10.1016/J.ENDM.2007.01.055MaRDI QIDQ3439613zbMATH OpenOpenAlexFDO

Authors Moshe Rosenfeld

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.01.055

zbMATH Keywords

Shannon capacitytorus

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Recommendations

• How to solve the torus puzzle
• A Dynamic Puzzle
• New lower bounds for the Shannon capacity of odd cycles
• A covering problem for tori
• On the Shannon capacity of a graph

Cites work

• A Dynamic Puzzle
• Modified linear dependence and the capacity of a cyclic graph
• On the Shannon capacity of a graph

Cited in

(1)

• On the dimension of the space of harmonic functions on a discrete torus

This page was built for publication: A “simple” rectangular puzzle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439613)