overfull conjecture

Source placement record

The overfull conjecture that a graph with maximum degree Δ ( G ) ≥ n / 3 {\displaystyle \Delta (G)\geq n/3} {\displaystyle \Delta (G)\geq n/3} is class 2 if and only if it has an overfull subgraph S {\displaystyle S} {\displaystyle S} satisfying Δ ( S ) = Δ ( G ) {\displaystyle \Delta (S)=\Delta (G)} {\displaystyle \Delta (S)=\Delta (G)}.

Review boundary: This page preserves a row from the revision-pinned source index. It is not a reviewed canonical dossier and does not independently verify or strengthen the cited claim.

Source status: Open
Field: Graph theory · Graph coloring and labeling
Record type: Revision-pinned source placement
Verification: Source-index reviewed
Source grade: secondary
Reviewed: 2026-07-27T18:04:33.834Z

Context and review boundary

The source list does not provide a uniform standalone exposition for every row. Use the exact subsection and linked topic article as the starting point for a reviewed reading trail.

Formal boundary

No independent formal statement has been added to this source-index record. This prevents the catalog from inventing notation or silently strengthening the cited claim.

Known approaches and partial results

Pending review. No structured approach or partial-result note has been added to this source placement.

Source trail

Wikipedia list subsection — Exact Graph theory › Graph coloring and labeling subsection in the revision-pinned source.
Wikipedia topic article — Background article linked by the source index; follow its references for deeper study.
Pinned source revision 1366281547 — Revision-pinned snapshot from 7/27/2026.