On set intersection representations of graphs (Q3633007)
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 5565368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On set intersection representations of graphs |
scientific article; zbMATH DE number 5565368 |
Statements
On set intersection representations of graphs (English)
0 references
16 June 2009
0 references
intersection graphs
0 references
edge clique covering number
0 references
bicliques
0 references
Hadamard graphs
0 references
sylvester graphs
0 references
Ramsey graphs
0 references
Boolean functions
0 references
depth-2 circuits
0 references
0 references
0 references
0.7768510580062866
0 references
0.7602972984313965
0 references
0.7539544701576233
0 references
0.7539544701576233
0 references
0.7510068416595459
0 references
