Edge distribution of graphs with few induced copies of a given graph
classification
🧮 math.CO
keywords
graphcopiesgiveninducedcontainsdistribiteddistributionedge
read the original abstract
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
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.