The computational strength of matchings in countable graphs. (arXiv:2006.11334v1 [math.LO]) http://arxiv.org/abs/2006.11334
QOTO: Question Others to Teach Ourselves An inclusive, Academic Freedom, instance All cultures welcome. Hate speech and harassment strictly forbidden.