2 problems

Let $S(n)$ denote the maximum number of connected components (clusters) obtainable in a bounded confidence (BC) process with $n$ agents. Half-density limit conjecture. … Determinin…

Let $(c_1,\dots,c_l)$ be a sequence of cluster sizes of a bounded confidence (BC) process. A subsequence is connected when its corresponding clusters are connected in the final con…