Welcome to MathOverflow

Question

1

Hi all:

Sorry for my bad wordy title, my question is:

Input:

Given a m*n 4-connected grid of points each of which is labelled with an integer $\in\{1,...,k\}$ . We say a label configuration z is feasible (k-connected-components partition) if points of the same label are connected on the grid and there are k different labels in total.

Output:

How many different feasible configuration are there?

Thanks for your help

E.E.

flag	asked Jul 7 at 20:14 Eminemya 33●4

tergi · Answer 1 · 2012-07-07 22:07:22Z UTC

1

Constraining m=n and k=2, this is http://oeis.org/A068416.

edited Jul 7 at 22:07

answered Jul 7 at 21:17

tergi
216●2

How to enumerate all possible k-connected-components partition of a two dimensional 4-connected grid

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

1 Answer

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.