Embedding products into symmetric products of finite graphs (Q1646549)
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 6894000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding products into symmetric products of finite graphs |
scientific article; zbMATH DE number 6894000 |
Statements
Embedding products into symmetric products of finite graphs (English)
0 references
25 June 2018
0 references
The question treated in the paper, under the usual notation, is the embeddability of the product \(X^n\) into the symmetric product \(F_n(X)\) when \(X\) is a finite graph. It has been proved previously that if \(X\) is a finite graph, then \(X^2\) can be embedded into \(F_2(X)\) iff \(X\) is an arc. The obtained result says that the same statement holds for \(n=3\). So the following holds: If \(X\) is a finite graph, then \(X^3\) can be embedded into \(F_3(X)\) iff \(X\) is an arc. Besides some other results, at the end of the paper the authors construct a geometric model for \(F_3(Y)\), where \(Y\) is a simple triod.
0 references
embedding
0 references
product
0 references
symmetric product
0 references
finite graph
0 references
0.8289967179298401
0 references
0.7500275373458862
0 references