Domino question

[David Wilson]

Imagine placing a set of dominoes with numbers 1 through n (there would be choose(n, 2) such dominoes, having each possible pair of numbers). Let a region be an edge-connected set of grid squares (polyomino) covered by the same domino number. In terms of n, what is the smallest number of regions possible once all dominoes have been placed?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20060823/18a68d35/attachment-0001.htm>