Complete families of graphs (Q2706951)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1582346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete families of graphs |
scientific article; zbMATH DE number 1582346 |
Statements
10 October 2002
0 references
family of graphs
0 references
booms
0 references
completeness
0 references
Complete families of graphs (English)
0 references
A family of graphs of order \(n\) is called complete if for every graph of order \(n\) it holds that either the graph or its complement contains a member of the family in consideration. The authors prove that the family of so-called booms of order \(n\) is complete, and only about one half of the family is needed for the completeness property.
0 references
0.7470396161079407
0 references
0.7418524026870728
0 references
0.728559136390686
0 references
