Bounding the vertex cover number of a hypergraph
暂无分享,去创建一个
[1] E. Slud. Distribution Inequalities for the Binomial Law , 1977 .
[2] Nathaniel Dean,et al. On obstructions to small face covers in planar graphs , 1992, J. Comb. Theory, Ser. B.
[3] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[4] János Pach,et al. Some geometric applications of Dilworth's theorem , 1993, SCG '93.
[5] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[6] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[7] János Komlós,et al. Almost tight bounds forɛ-Nets , 1992, Discret. Comput. Geom..
[8] J. Komlos,et al. Almost tight bounds for $\epsilon$-nets , 1992 .
[9] Jon Folkman. Notes on the Ramsey Number N(3, 3, 3, 3) , 1974, J. Comb. Theory, Ser. A.