is_three_uniform
def
A hypergraph F (a finite family of finite sets of vertices) is 3-uniform if every hyperedge e in F has cardinality 3.
Statement
def is_three_uniform {V : Type*} (F : Finset (Finset V)) : Prop
- Defined in
- arXiv:2610.14829 Section 2
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 7
- turan_hypergraph_three_uniformFor every natural number n, the balanced 3-partite Turán hypergraph T_n is 3-uniform.
- zycle_hom_implies_closed_walkIf f : ZMod ℓ × Fin 2 → α is a hypergraph homomorphism is_hypergraph_hom from the zycle Z_ℓ to a 3-uniform hypergraph G : Finset (Finset…
- extremal_numberFor a natural number n and a hypergraph F on vertex type W, the extremal number extremal_number n F is the maximum cardinality of an…
- codegree_extremal_numberFor a natural number n and a hypergraph F on vertex type W, the real-valued codegree extremal number codegree_extremal_number n F is the…
- fano_free_local_forbiddenIn any 3-uniform Fano-free hypergraph H : Finset (Finset V), if {x, y, z} is an edge of H, then for all vertices a, b, c, d in V, the six…
- op_1453_zycle_four_three_uniformThe 4-zycle Z₄ is a 3-uniform hypergraph, meaning every hyperedge has cardinality 3.
- tripartite_turan_hypergraph_three_uniformFor any family of finite sets V : ZMod 3 → Finset α, the tripartite Turán hypergraph tripartite_turan_hypergraph V is 3-uniform…
Read back from the Lean
For an arbitrary type V and a finite set F of finite subsets of V (a Finset (Finset V)), is_three_uniform F asserts that every member e ∈ F has cardinality equal to 3.
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
/-- A hypergraph F is 3-uniform if every edge has cardinality 3. -/ def is_three_uniform {V : Type*} (F : Finset (Finset V)) : Prop := ∀ e ∈ F, e.card = 3