If you followed Andy Drucker’s series of posts on infinite trees and were craving more, be prepared for more foliage:
Via Ars Mathematica, a pointer to Keith Devlin’s column on a bizarre counter-version of Konig’s tree lemma: namely, if you have an uncountably large tree with countably large levels, then it is not necessarily true that an uncountable path must exist.
