Graphs with many copies of a given subgraph
Nikiforov, Vladimir
Original · EN
We 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.