Triangle-Intersecting Families of Graphs

Details Triangle-Intersecting Families of Graphs Triangle-Intersecting Families of Graphs

2010-10-23

arxiv.org/abs/1010.4909v3

Mathematics

Combinatorics

43 pages

Scientific paper

A family of graphs F is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. A conjecture of Simonovits and Sos from 1976 states that the largest triangle-intersecting families of graphs on a fixed set of n vertices are those obtained by fixing a specific triangle and taking all graphs containing it, resulting in a family of size (1/8) 2^{n choose 2}. We prove this conjecture and some generalizations (for example, we prove that the same is true of odd-cycle-intersecting families, and we obtain best possible bounds on the size of the family under different, not necessarily uniform, measures). We also obtain stability results, showing that almost-largest triangle-intersecting families have approximately the same structure.

Affiliated with

Also associated with

No associations

Rating

Triangle-Intersecting Families of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Triangle-Intersecting Families of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangle-Intersecting Families of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276998