Counting \(H\)-free graphs (Q1918567): Difference between revisions

We estimate the cardinality of the class of all \(H\)-free graphs on \(n\) (labelled) vertices with \(m\) edges by establishing good bounds for the probability that a random graph in the \(G(n, m)\)-model does not contain a given subgraph.

0 references

zbMATH Keywords

cardinality

0 references

\(H\)-free graphs

0 references

probability

0 references

random graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Threshold functions for small subgraphs

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0851.05057

0 references

DOI

10.1016/0012-365X(94)00334-F

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1918567

@@ Property / cites work @@
+Threshold functions for small subgraphs
@@ Property / cites work: Threshold functions for small subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3360223
@@ Property / cites work: Q3360223 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3333079
@@ Property / cites work: Q3333079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3975008
@@ Property / cites work: Q3975008 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3781137
@@ Property / cites work: Q3781137 / rank @@
+Normal rank