Timeline for Non-containing subsets of two sizes

10 events

when toggle format	what		by	license	comment
Jul 6, 2019 at 18:22	vote	accept	doe
May 22, 2019 at 21:50	history	became hot network question
May 22, 2019 at 18:26	answer	added	Russ Woodroofe		timeline score: 2
May 22, 2019 at 17:02	answer	added	Gerhard Paseman		timeline score: 4
May 22, 2019 at 16:23	answer	added	Richard Stanley		timeline score: 4
May 22, 2019 at 16:18	comment	added	Gerhard Paseman		Indeed. I had an off by one error, and did not check for it. The next step then is to look at the bipartite graph and induce an edge coloring by the connected vertex coloring. Thanks for explaining. Gerhard "Now I See The Challenge" Paseman, 2019.05.22.
May 22, 2019 at 16:07	comment	added	doe		The challenge is how it follows. Sperner says that there can be at most $\binom{2n+1}{n}$ pairwise non-containing subsets, but $2\binom{2n}{n-1} < \binom{2n+1}{n}$.
May 22, 2019 at 16:00	comment	added	Gerhard Paseman		It should follow. I am not seeing what the challenge is here. Can you explain your difficulty? Gerhard "One Plus One Equals Two?" Paseman, 2019.05.22.
May 22, 2019 at 13:45	review	First posts
May 22, 2019 at 13:46
May 22, 2019 at 13:41	history	asked	doe	CC BY-SA 4.0