A short proof of the existence of a minor-universal countable planar graph

TL;DR

This paper presents a concise construction of a countable planar graph that contains every other countable planar graph as a minor, simplifying previous approaches.

Contribution

It introduces a shorter, more efficient proof of the existence of a minor-universal countable planar graph.

Findings

Constructed a shorter proof for the existence of a minor-universal planar graph

Provided a new, simplified construction method

Confirmed the universality property for all countable planar graphs

Abstract

We produce a new, shorter construction of a minor-universal planar graph.