Generalization of Erdős and Rousseau's counting lemma in graph theory (Q5320159)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalization of Erdős and Rousseau's counting lemma in graph theory |
scientific article; zbMATH DE number 5584559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization of Erdős and Rousseau's counting lemma in graph theory |
scientific article; zbMATH DE number 5584559 |
Statements
22 July 2009
0 references
counting lemma
0 references
complete \(m\)-partite graph
0 references
subgraph
0 references
0.7800166010856628
0 references
0.7520074844360352
0 references
0.7519404888153076
0 references
0.7482110857963562
0 references
0.7469533681869507
0 references
