组合数学 (Spring 2013)/Problem Set 4: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

5 June 2013

  • curprev 11:4811:48, 5 June 2013‎ imported>Etone‎ 1,540 bytes +1,540‎ Created page with "==Problem 1== Let <math>k\le\frac{n}{2}</math> and <math>\mathcal{F}\subset 2^{[n]}</math> consist of sets of size at most <math>k</math>, i.e. <math>\forall S\in\mathcal{F}</mat…"
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Spring_2013)/Problem_Set_4"