G-Intersection Theorems for Matchings and Other Graphs

If G is a graph with vertex set [n] then A 2[n] is G-intersecting if for all A, B A either A B = or there exist a A and b B such that a G b. The question of how large a k-uniform G-intersecting family can be was first considered by Bohman, Frieze, Ruszink

• Type: Journal
• Year: 2008
• Where: CPC
• Authors: J. Robert Johnson, John M. Talbot
• Keywords: CPC 2008, Extremal Families, K-uniform G-intersecting Family, Sharp Phase Transition