Handshape is the hardest path in Portuguese Sign Language acquisition: Towards a universal modality constraint.

Thus, we may claim that, at least in the context of sparse graphs that arise as subgraphs of random graphs, there is a full, natural generalization of the equivalence lemma, Theorem