AFTD Auto-Formalizing Theoretical Domains

mixed_graph_is_valid

def

A mixed graph on V: undirected edges E (a simple graph) and arcs A, with no loops and at most one edge or arc between two vertices (no antiparallel arcs, no arc parallel to an edge).

Statement

def mixed_graph_is_valid {V : Type*} (E : SimpleGraph V) (A : V → V → Prop) : Prop
Defined in
arXiv:2610.14110 (New mixed cages, bounds and computational results), Sec. 2 (mixed graphs: edges and arcs, no loops, at most one edge or arc between two vertices).
Verified
17 Oct 2026
Axioms
none listed
Used by 6

Lean source view module on GitHub

/-- `(E, A)` is a mixed graph: `A` is irreflexive and asymmetric (no antiparallel arcs) and no arc joins two vertices joined by an edge. `E` is a `SimpleGraph`, so it has no loops or parallel edges. -/
def mixed_graph_is_valid {V : Type*} (E : SimpleGraph V) (A : V → V → Prop) : Prop :=
  (∀ x, ¬ A x x) ∧ (∀ x y, A x y → ¬ A y x) ∧ ∀ x y, E.Adj x y → ¬ A x y
See it in the graphDiscuss this resultChallenge it