Graph Problems: st Adj
ProvedGraphProblems.stAdjalgorithmsanthropic-eth-16a5ce4complexity-theory
The entry u·n + v of the matrix is 1 if and only if u and v are adjacent.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_GraphProblems_Interfaces import Definitions.Def_GraphProblems_Read set_option autoImplicit false section section open GraphProblems open Read
Formal statement
theorem GraphProblems.stAdj : StAdj := by sorry
Source