Timeline for Chromatic number of rainbow hypergraphs

7 events

when toggle format	what		by	license	comment
Feb 11, 2021 at 7:08	comment	added	Dominic van der Zypen		Thank you very much for editing your answer - I appreciate it and accepted it.
Feb 11, 2021 at 7:07	vote	accept	Dominic van der Zypen
Feb 11, 2021 at 1:48	history	edited	bof	CC BY-SA 4.0	added 27 characters in body
Feb 10, 2021 at 23:01	history	edited	bof	CC BY-SA 4.0	added 808 characters in body
Feb 10, 2021 at 14:21	comment	added	Dominic van der Zypen		To make things more precise: I would be glad if you can define the $\sigma$-algebra ${\cal A}$ on $2^\omega$ you consider, as well as the probability measure $P:{\cal A}\to [0,1]$. Then we have to establish $A \in {\cal A}$ where $A$ is the collection of non-colorings of the rainbow hypergraph $H$. - Or am I completely off the track?
Feb 10, 2021 at 14:16	comment	added	Dominic van der Zypen		Thanks for expanding your comment into an answer. I am uneasy about "events", how can we put a probability measure $P$ on the set of maps $c:\omega \to \{0,1\}$ (let's call this set $2^\omega$)? So I assume $A\subseteq 2^\omega$ is the collection of functions $c\in 2^\omega$ such that $c$ is not a proper coloring of the rainbow hypergraph $H$. I would be happy to know $A \neq 2^\omega$, but you appear to prove something stronger: $P(A)<1$, but how do you define $P$?
Feb 10, 2021 at 12:48	history	answered	bof	CC BY-SA 4.0