A tree counterexample to AutoGraphForge conjecture 991e8e84

A tree with 16 vertices has burning number 3 and power domination number 5, refuting AutoGraphForge conjecture 991e8e84. We give a family of trees with burning number 3 and arbitrarily large power domination number, a direct proof, and an exhaustive Python check of the finite witness. The note and verifier were developed with OpenAI Codex.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24383171
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A tree counterexample to AutoGraphForge conjecture 991e8e84

Rohan Arun
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
article

A tree counterexample to AutoGraphForge conjecture 991e8e84

Rohan Arun
article en

Abstract

A tree with 16 vertices has burning number 3 and power domination number 5, refuting AutoGraphForge conjecture 991e8e84. We give a family of trees with burning number 3 and arbitrarily large power domination number, a direct proof, and an exhaustive Python check of the finite witness. The note and verifier were developed with OpenAI Codex.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon