Residual order four in GP(7,2): an alternative proof for Hausmann's Question 5.4 (arXiv:2611.05178v1, Section 5), after AFTD (2026)

Following AFTD's negative answer dated November 5, 2026, to Hausmann's Question 5.4 in Weighted Max Cut in Subcubic Graphs (arXiv:2611.05178v1, Section 5), we give a different counterexample with an exact residual-order calculation: the generalized Petersen graph GP(7,2) has odd girth five, but deleting any independent set leaves a component with at least four vertices. We prove this by classifying its maximal independent sets into five symmetry classes. The bound four is attained on this graph. The same classification gives an obstruction to the nonempty-independent-side version of Question 5.3; its printed quantifiers admit an empty-side solution.

Authors

Institutions

Publication Details

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

Residual order four in GP(7,2): an alternative proof for Hausmann's Question 5.4 (arXiv:2611.05178v1, Section 5), after AFTD (2026)

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Residual order four in GP(7,2): an alternative proof for Hausmann's Question 5.4 (arXiv:2611.05178v1, Section 5), after AFTD (2026)

Wenlin Zhang, Haobo Ma
preprint en

Abstract

Following AFTD's negative answer dated November 5, 2026, to Hausmann's Question 5.4 in Weighted Max Cut in Subcubic Graphs (arXiv:2611.05178v1, Section 5), we give a different counterexample with an exact residual-order calculation: the generalized Petersen graph GP(7,2) has odd girth five, but deleting any independent set leaves a component with at least four vertices. We prove this by classifying its maximal independent sets into five symmetry classes. The bound four is attained on this graph. The same classification gives an obstruction to the nonempty-independent-side version of Question 5.3; its printed quantifiers admit an empty-side solution.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
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