Combinatorics · Oct 6, 2026
Seymour’s second-neighborhood conjecture
Proves Seymour's second-neighborhood conjecture: every nonempty finite oriented graph has a vertex with at least as many vertices at directed distance exactly two as at directed distance one. Oriented graphs may be arbitrary apart from the exclusion of loops and oppositely directed edge pairs.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model