digraph_out_degree
def
The out-degree d⁺(v) of a vertex v in a finite directed graph D is the number of out-neighbors of v, that is, the cardinality of the set of vertices w such that there is an arc from v to w.
Statement
def digraph_out_degree {V : Type*} [Fintype V] (D : Digraph V) [DecidableRel D.Adj] (v : V) : ℕ
- Defined in
- arXiv:2610.39702, Section 2.1
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 8
- not_digraph_ckk_subdivision_three_exceptionalThe statement
digraph_ckk_subdivision_three_exceptionalis false: The statement omits any nonemptiness hypothesis on the vertex type, so… - tournament_strong_king_iff_in_neighbor_out_degree_leIn any finite tournament T, a vertex v is a strong king if and only if every in-neighbor u of v (that is, every vertex u with an arc from…
- tournament_max_out_degree_is_strong_kingIn any finite tournament T, every vertex v of maximum out-degree is a strong king.
- digraph_exceptional_verts_card_leFor any finite directed graph D on a finite vertex type V with decidable adjacency, the number of exceptional vertices (vertices of…
- oriented_star_one_edge_os_and_oasIf an oriented star D has one edge (two vertices), then D is both OS and OAS.
- tournament_two_path_diff_eq_out_degree_diffIn any finite tournament T, if there is an arc from u to v, then the difference between the number of directed two-paths from v to u and…
- digraph_exceptional_vertsFor a finite directed graph D on a finite vertex type V with decidable adjacency, the set of exceptional vertices O(D) is the finite set…
- oriented_star_densityThe homomorphism density of an oriented star with center c in a digraphon W is the integral over x in [0, 1] of (W^-(x))^(inDegree c) *…
- not_digraph_ckk_subdivision_three_exceptionalThe statement
Read back from the Lean
For a finite type V, a directed graph D : Digraph V with a decidable adjacency relation D.Adj, and a vertex v : V, digraph_out_degree D v is defined as the number of vertices w : V such that D.Adj v w holds (that is, the cardinality of the finset of all out-neighbors w of v).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The out-degree of a vertex in a finite directed graph. -/ def digraph_out_degree {V : Type*} [Fintype V] (D : Digraph V) [DecidableRel D.Adj] (v : V) : ℕ := (Finset.univ.filter (D.Adj v)).card