Graphs with many copies of a given subgraph
classification
🧮 math.CO
keywords
containscopiesgivenmanyordersubgraphblow-upgraph
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.