graph_satisfies_property_l
def
A simple graph satisfies property (L) if every 6-element subset of vertices spans at most 22 directed edges.
Statement
def graph_satisfies_property_l {V : Type*} (G : SimpleGraph V) : Prop
- Defined in
- scout/2610-24484-erd-h-o-s-gy-arf-as-balanced-five-colorings.md:1275
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Built on 1
- edges_ord_withinFor a simple graph G and a finite subset S of vertices, the number of directed edges (ordered pairs of distinct adjacent vertices) spanned…
- Used by 2
- balanced_five_coloring_color_class_property_lFor an arbitrary type V, in any balanced edge coloring c : Sym2 V → Fin 5, every color class graph edge_color_class_graph c k satisfies…
- balanced_five_coloring_exists_color_class_bounds_and_propertiesFor an arbitrary finite type V with 26 elements, if c : Sym2 V → Fin 5 is a balanced edge coloring, then some color class graph has no…
Read back from the Lean
For a simple graph G on a type V, graph_satisfies_property_l G asserts that for every finite subset S of V with cardinality 6, the number of ordered pairs (u, v) ∈ S × S with u ≠ v such that u is adjacent to v in G is at most 22 (which, since G is undirected and loopless, is equivalent to S spanning at most 11 undirected edges).
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
/-- Property (L): every 6 vertices span at most 11 undirected edges (at most 22 directed edges). -/ def graph_satisfies_property_l {V : Type*} (G : SimpleGraph V) : Prop := ∀ S : Finset V, S.card = 6 → edges_ord_within G S ≤ 22