Title: Daniel's Flashcards / Year 4 / Term 2 / Entropy Methods in Combinatorics

html: Definition. Let X be a set of size n and let G be a set of graphs with vertex set X. Then G is Δ-intersecting (read as “triangle-intersecting”) if for all G 1 , G 2 ∈ G, G 1 ∩ G 2 contains a triangle.