The accessibility rank of weak equivalences
  We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak equivalences between simplicial sets is finitely accessible. 
G. Raptis and J. Rosick\'y
math.AT math.CT