Pooling designs are fundamental tools in many applications such as biotechnology and network security. Many famous pooling designs have been constructed from mathematical structures by "containing relations". Recently, pooling designs constructed by "intersecting relation" have been proposed by Guo and Wang (2011). Constructing by intersecting relation provides much better error-tolerance capabilities. We study the error-tolerance capabilities of pooling designs constructed by intersecting relation from combinatorial structures proposed by D'yachkov et al. (2007) and Lv et al. (2014). (C) 2015 Elsevier B.V. All rights reserved.