暂无分享,去创建一个
[1] W. T. Gowers,et al. RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .
[2] Vojtech Rödl,et al. Partial Steiner systems and matchings in hypergraphs , 1998, Random Struct. Algorithms.
[4] Vojtech Rödl,et al. Near Perfect Coverings in Graphs and Hypergraphs , 1985, Eur. J. Comb..
[5] Ding‐Zhu Du,et al. Wiley Series in Discrete Mathematics and Optimization , 2014 .
[6] Jeong Han Kim,et al. Nearly perfect matchings in regular simple hypergraphs , 1997 .
[7] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[8] Joel H. Spencer,et al. Asymptotic behavior of the chromatic index for hypergraphs , 1989, J. Comb. Theory, Ser. A.