Lesson plan

Common graph

In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly speaking, F is a common graph if it "commonly" appears as a subgraph, in a sense that the total number of copies of F in any graph G and its complement \overline{G} is a large fraction of all possible copies of F on the same vertices. Intuitively, if G contains few copies of F , then its complement \overline{G} must contain lots of copies of F in order to compensate for it. Common graphs are closely related to other graph notions dealing with homomorphism density inequalities. For example, common graphs are a more general case of Sidorenko graphs.

Back to article

Article summary

In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly speaking, F is a common graph if it "commonly" appears as a subgraph, in a sense that the total number of copies of F in any graph G and its complement \overline{G} is a large fraction of all possible copies of F on the same vertices. Intuitively, if G contains few copies of F , then its complement \overline{G} must contain lots of copies of F in order to compensate for it. Common graphs are closely related to other graph notions dealing with homomorphism density inequalities. For example, common graphs are a more general case of Sidorenko graphs.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.