Mathematics – Combinatorics
Scientific paper
2010-02-11
Mathematics
Combinatorics
Scientific paper
Consider the triangle-free graph process, which starts from the empty graph on $n$ vertices and a random ordering of the possible ${n \choose 2}$ edges; the edges are added in this ordering provided the graph remains triangle free. We will show that there exists a constant $c$ such that no copy of any fixed finite triangle-free graph on $k$ vertices with at least $ck$ edges asymptotically almost surely appears in the triangle-free graph process.
Gerke Stefanie
Makai Tamás
No associations
LandOfFree
No Dense Subgraphs Appear in the Triangle-free Graph Process 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 No Dense Subgraphs Appear in the Triangle-free Graph Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No Dense Subgraphs Appear in the Triangle-free Graph Process will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-68193