Finite witnesses, payer curvature, and certified reductions for Seymour's second-neighborhood conjecture at minimum out-degree eight

We study Seymour's second-neighborhood conjecture at minimum out-degree eight using degree-independent structural tools from a separately published companion paper and proof-producing finite reductions. We independently reconstruct the minimum-out-degree-seven boundary, obtain the exact degree-eight witness range 19 <= n <= 37, eliminate the top-level rows (5,3), (6,2), (6,3), and (7,1), and exclude every spanning-arc-minimal, order-twenty degree-eight order-minimal branch of minimum indegree at least six using eight independently checked LRAT certificates. The full minimum-out-degree-eight case remains open: the top-level rows (7,2) and (7,3) survive. This record contains the version 1.0.0 paper, source, deterministic proof archive, manifests, replay scripts, and exact generators.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-23
DOI
https://doi.org/10.5281/zenodo.21945854
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finite witnesses, payer curvature, and certified reductions for Seymour's second-neighborhood conjecture at minimum out-degree eight

Hainan Zhao
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
article

Finite witnesses, payer curvature, and certified reductions for Seymour's second-neighborhood conjecture at minimum out-degree eight

Hainan Zhao
article en

Abstract

We study Seymour's second-neighborhood conjecture at minimum out-degree eight using degree-independent structural tools from a separately published companion paper and proof-producing finite reductions. We independently reconstruct the minimum-out-degree-seven boundary, obtain the exact degree-eight witness range 19 <= n <= 37, eliminate the top-level rows (5,3), (6,2), (6,3), and (7,1), and exclude every spanning-arc-minimal, order-twenty degree-eight order-minimal branch of minimum indegree at least six using eight independently checked LRAT certificates. The full minimum-out-degree-eight case remains open: the top-level rows (7,2) and (7,3) survive. This record contains the version 1.0.0 paper, source, deterministic proof archive, manifests, replay scripts, and exact generators.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 8%
Complexity and Algorithms in Graphs
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.