The number of graphs with large forbidden subgraphs

Details The number of graphs with large forbidden subgraphs The number of graphs with large forbidden subgraphs

2010-01-24

arxiv.org/abs/1001.4249v1

Mathematics

Combinatorics

6 pages

Scientific paper

In this note, extending some results of Erdos, Frankl, Rodl, Alexeev, Bollobas and Thomason we determine asymptotically the number of graphs which do not contain certain large subgraphs. In particular, if H_1,...,H_n,... are graphs with chromatic numbers r_1,...,r_n,... and order o(log n), we dermine asymptotically the number of graphs of order n not containing H_n as a subgraph. We also give similar results for induced subgraphs.

Affiliated with

Also associated with

No associations

Rating

The number of graphs with large forbidden subgraphs 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 The number of graphs with large forbidden subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of graphs with large forbidden subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696766