The number of graphs with large forbidden subgraphs
Bollobas, Bela · Nikiforov, Vladimir
الأصل · EN
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₁,...,Hₙ,... are graphs with chromatic numbers r₁,...,rₙ,... and order o(log n), we dermine asymptotically the number of graphs of order n not containing Hₙ as a subgraph. We also give similar results for induced subgraphs.
الترجمة العربية
لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.