Small but unwieldy: a lower bound on adjacency labels for small classes (Q6631355)
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: Small but unwieldy: a lower bound on adjacency labels for small classes |
scientific article; zbMATH DE number 7937496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Small but unwieldy: a lower bound on adjacency labels for small classes |
scientific article; zbMATH DE number 7937496 |
Statements
Small but unwieldy: a lower bound on adjacency labels for small classes (English)
0 references
1 November 2024
0 references
labeling schemes
0 references
implicit graph conjecture
0 references
universal graphs
0 references
random graph
0 references
subgraphs
0 references
small classes
0 references
0 references
