Are all trees planar graphs? Surely, right? I don't know how to prove it, though.
=> More informations about this toot | More toots from wqferr@mathstodon.xyz
Found it! Wagner's theorem states:
A finite graph is planar if and only if it does not have K5 or K3,3 as a minor.
Since both of these have cycles and trees don't (by definition) that proves all trees are planar.
=> More informations about this toot | More toots from wqferr@mathstodon.xyz
text/gemini
This content has been proxied by September (3851b).