simple_graph_triangle_edge_family
def
The family of three-edge sets of all triangles of a finite simple graph.
Statement
noncomputable def simple_graph_triangle_edge_family {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : Finset (Finset (Sym2 V))
- Source
- Graph-to-set-family bridge for the triangle packing separator route.
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Built on 1
- finite_vertex_set_edge_encodingThe non-diagonal unordered vertex pairs spanned by a finite vertex set.
- Used by 20
- ten_vertex_exchange_packing_upperThe witness has no packing of eleven edge-disjoint triangles.
- ten_vertex_exchange_edge_avoidableFor each of the 35 edges, a ten-triangle packing avoids that edge.
- simple_graph_maximum_packing_fixed_two_budget_counterexampleA nine-vertex graph has a maximum triangle packing with at most one singleton-forced edge per packed triangle, but no triangle cover…
- simple_graph_two_edge_stable_connected_family_exchange_trap_counterexampleThere is a connected 18-vertex graph with 57 edges, packing number 14, all edge pairs avoidable by maximum packings, at least three…
- simple_graph_triangle_edge_family_memA set of three edges belongs to the triangle edge family of G iff it is the set of non-diagonal pairs spanned by some three vertices…
- simple_graph_unrestricted_singleton_witness_edge_union_counterexampleThe unrestricted witness-edge union does not satisfy the proposed sunflower forced-base half-independence statement: the explicitly…
- ten_vertex_exchange_family_eqThe 52 explicit triangle edge sets are exactly the triangle family of the ten-vertex graph.
- ten_vertex_exchange_triangle_connectedAfter excluding each graph edge, the triangle family is connected under sharing any other edge.
- simple_graph_pair_stable_support_max_incidence_two_bad_packing_counterexampleThere is an eight-vertex two-edge-stable graph with a maximum triangle packing covering every vertex, in which every vertex belongs to at…
- simple_graph_stable_unforced_anchor_ten_exampleA two-edge-stable graph has a full-support maximum packing with a fully forced K4 face whose internal anchor lies only in unforced packed…
- ten_vertex_exchange_codegreeEach edge of the witness lies in at least three triangles.
- simple_graph_triangle_edge_family_induce_mapThe image of the triangle edge-family of an induced graph is exactly the original graph triangle edge-family restricted to triangles…
- simple_graph_in693_ten_seed_packing_numberThe concrete ten-vertex five-link seed has triangle packing number eight.
- simple_graph_forced_k4_face_pivot_retains_forcingIf an edge-disjoint triangle packing contains abc and a four-clique abcx has no packed spokes ax, bx, cx, replacing abc by abx preserves…
- simple_graph_seven_packing_local_minimum_seed_supergraph_rigidityA graph on the nine vertices of the local-exchange seed that contains all seed edges and has triangle packing number at most seven adds no…
- simple_graph_stable_min_two_triangles_conflict_five_cycleThere is an 11-vertex graph with a maximum packing of five edge-disjoint triangles, every graph edge omitted by some maximum packing and…
- simple_graph_maximum_packing_two_forced_edges_k4For a maximum triangle packing, if a packed triangle has two singleton-forced edges then its three vertices have a common fourth vertex…
- simple_graph_stable_packing_twelve_seed_supergraph_rigidityFor the displayed 20-vertex, 60-edge seed, any supergraph on the same vertices in which every edge lies in at least two triangles and…
- simple_graph_stable_triangle_active_edge_in_maximum_packingIn a finite graph where deleting any edge preserves the maximum triangle packing number, every edge belonging to a triangle is used by…
- simple_graph_pair_stable_triangle_active_incidence_two_unpacked_nonbipartiteThere is a triangle-active two-edge-stable eight-vertex graph with a support-maximal maximum triangle packing in which every vertex is in…
Lean source view module on GitHub
noncomputable def simple_graph_triangle_edge_family {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : Finset (Finset (Sym2 V)) := by classical exact ((Finset.univ : Finset (Finset V)).filter (G.IsNClique 3)).image finite_vertex_set_edge_encoding