About this episode
An exploration of the cubic (3-regular) cage graphs: the smallest number of vertices needed for a graph to have a given girth. We discuss what A000066 counts, known results for girths up to 12, the remarkable unique cubic cage with 112 vertices and girth 11 proved by McKay and Mirvold, and how higher-degree cages (such as A0006856 for 4-regular cages) expand the landscape. We’ll also touch on practical connections to network design and coding theory, and why the OEIS serves as a living map of these interlinked ideas.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Get every episode summarized
Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Intellectually Curious
Free Pause Tokens Solve AI Multitasking
Intellectually Curious
Sep 14, 20266:39failed
Claude’s Autonomous Formalization of Fermat’s Last Theorem
Intellectually Curious
Sep 13, 20266:48completed
Random Attention: How AI Gets Faster by Forgetting
Intellectually Curious
Sep 12, 20266:13completed
The Alien Anatomy of the Bigfin Squid
Intellectually Curious
Sep 11, 20265:48completed