4:43 AM
0

I assume knowledge of the Collatz conjecture. Here I'm looking only at total stopping times \$t(n)\$, and mostly will drop the word "total." Just looking at relatively simple graphs of stopping times on Wikipedia shows many patterns in stopping times, sets of overlapping discontinuous "curves". In ...

4 hours later…
8:34 AM
[ SmokeDetector | MS ] Korean character in title, mostly non-latin body, mostly non-latin title, several emoji in title (351): 울산⠥달포차【dalƤocha2.콤】울산휴게텔║울산오피⠳울산안마〝울산건마‭ by rocketman555‭ on `math.SE`

3 hours later…
11:30 AM
@Mathphile Hi

Hello @Peter

2 hours later…
1:22 PM
[ SmokeDetector | MS ] Offensive answer detected, potentially bad keyword in answer, toxic answer detected (158): Normal distribution general‭ by Your DADDY‭ on `math.SE`

2:04 PM
Needs to be closed until clarification happens: math.stackexchange.com/q/4417917/29335

1 hour later…
3:06 PM
0

I will clarify the question by defining some straightforward concepts. Let G = (V, E) be a simple graph with chromatic number \$k\$. We call a subset \$V'\subset V\$ fully chromatic if every proper k-colouring of G uses also \$k\$ distinct colors on \$V'\$. We say such a fully chromatic set is minimal, i...

3 hours later…
5:37 PM