pair_codegree
def
The codegree of two vertices u and v in a hypergraph H is the number of hyperedges of H containing both u and v.
Statement
def pair_codegree {V : Type*} [DecidableEq V] (H : Finset (Finset V)) (u v : V) : ℕ
- Defined in
- arXiv:2611.12582 Section 1
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 1
- min_pair_codegreeThe minimum pair-codegree δ₂(H) of a 3-uniform hypergraph H on Fin n is the minimum of the pair-codegree over all pairs of distinct…
Read back from the Lean
Given a type V with decidable equality, a finite set of finite sets H : Finset (Finset V), and two elements u, v : V, pair_codegree H u v is defined as the number of elements e ∈ H such that both u ∈ e and v ∈ e (i.e., the cardinality of {e ∈ H | u ∈ e ∧ v ∈ e}).
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 codegree of a pair of vertices u, v in a 3-uniform hypergraph H is the number of edges containing both u and v. -/ def pair_codegree {V : Type*} [DecidableEq V] (H : Finset (Finset V)) (u v : V) : ℕ := (H.filter (fun e => u ∈ e ∧ v ∈ e)).card