The number of graphs with large forbidden subgraphs

DOI10.1016/j.ejc.2010.05.005zbMath1245.05091arXiv1001.4249OpenAlexW1985201221MaRDI QIDQ710718

Béla Bollobás, Vladimir Nikiforov

Publication date: 22 October 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.4249

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Supersaturation for hereditary properties ⋮ The typical structure of graphs with no large cliques ⋮ An efficient container lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs with many copies of a given subgraph
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On extremal problems of graphs and generalized graphs
• On the entropy values of hereditary classes of graphs
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Graphs with many r -cliques have large complete r -partite subgraphs
• Efficient testing of large graphs