Problem 101 (difficulty: 8/10)

Using König's lemma verify that if all finite subgraph of a countable graph can be embedded into the plane then the whole graph can be embedded into the plane as well.

Give me another random problem!

Subject, section:
Requested difficulty:
Request for a concrete problem:I want problem no.

Supported by the Higher Education Restructuring Fund allocated to ELTE by the Hungarian Government