Graphs with many copies of a given subgraph

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-11-22
dc.date.accessioned2026-07-07T08:44:30Z
dc.date.available2026-07-07T08:44:30Z
dc.descriptionWe show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n.
dc.identifierhttps://arxiv.org/abs/0711.3493
dc.identifierhttp://arxiv.org/abs/0711.3493
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142676
dc.subjectCombinatorics
dc.subject05C35
dc.titleGraphs with many copies of a given subgraph
dc.typetext

Files

Collections

arXiv