组合数学第三次作业
1.
(1) we choose xi denotes the ith coin,and Ti={xi}for i in {1,..n}
and according to an arbitrary subset Ti can be uniquely determined by the cardinalities|Si∩T|,1≤i≤m.
so we can weight every coin.
(2)
is equvient with
the number of Ti is 2n, and the number of Si is (n+1)∗m
and it’s easy to see that ||Si||>||Ti||
2.
(1)
let T is the set of vertex which for every vetex
and W is the set of vertex
So,
the dominating set
whenH′(p)=0,p=ln(d+1)d+1
and we have
3.
4.let Aijrepresents the event thatvi,vj are adjacent,and vi,vjare chosen in the independent set.
and d=2
According to Lovász local lemma,we have to prove
for any k>3, it holds.
5.
let Ae denotes the bed event that e is a monochromatic hyper edge .
the maximum degree of the dependency graph for the events A1,A2,...,An is d,
According to Lovász local lemma
we have to prove