OEIS A000314: Hussemi trees and polygonal cacti sequences
About this episode
An in-depth look at OEIS A000314: the number of mixed Hussemi trees, i.e., labeled polygonal cacti with bridges. We clarify cactus graphs, blocks that are edges or cycles, and the historical name Hussemi trees, then connect these structures to outer-planar graphs and discuss why many problems become polynomial on cactus graphs. We also explore real-world applications in circuits and comparative genomics, and highlight the triangular-cactus case tied to Rosa's conjecture on graph labelings.
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
Did OpenAI Solve Navier-Stokes? A Future-Shaping Claim Put to the Test
Intellectually Curious
Understanding the Hubble Tension
Intellectually Curious
OpenClaw 2.0 Feature Overview
Intellectually Curious
First to Leave, Last to Arrive: The $15 Million Fermi Explorer to Alpha Centauri
Intellectually Curious