Let $\{A_i\}_{i\in I}$ be a family of subsets of $\Bbb R^2$ (where $I=\Bbb N$ or $\Bbb Z$; I don't know if it makes a difference) such that
- $\bigcup_{i\in I} A_i=\Bbb R^2$
- $i\ne j\implies A_i\cap A_j=\emptyset$
- $A_i\ne\emptyset$
- $A_i$ is connected
- $A_i\cup A_{i+1}$ is connected
How often can it happen that $A_i\cup A_j$ is connected for $j\notin\{i-1,i,i+1\}$?
Definition. Let's say that an index $n\in I$ is infinitely linked/almost completely linked/completely linked if $A_n\cup A_i$ is connected for infinitely many/almost all/all $i\in I$.
One possibility configuration is to let the $A_i$ be vertical stripes, in which case no $n\in I$ is infinitely linked. With another configuration one can achieve that there exists exactly one $n\in I$ that is completely linked (let $A_n=\{(0,0)\}$ and all other $A_i$ suitable sectors of $\Bbb R^2\setminus\{(0,0)\}$). Can more than that be achieved?
- I.e., are there configurations with more (two, three, arbitrarily many, infinitely many, almost all, all) completely linked indices?
- Or maybe at least more almost completely linked indices?
- For $I=\Bbb Z$, I can find configurations two infinitely linked indices. Are three or more infinitely linked indices possible?
- Are two infinitely linked indices possible with $I=\Bbb N$?
Note that with $\Bbb R^3$ instead of $\Bbb R^2$ one can easily achieve that all indices are completely linked.