On combinatorial properties of spheres in euclidean spaces (Q762171): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q582577 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ernest Jucovič / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On embedding triangle-free graphs in unit spheres / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A triangle free graph which cannot be \(\sqrt3\) imbedded in any Euclidean unit sphere / rank | |||
Normal rank |
Latest revision as of 16:47, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On combinatorial properties of spheres in euclidean spaces |
scientific article |
Statements
On combinatorial properties of spheres in euclidean spaces (English)
0 references
1984
0 references
A graph G is said to be \(\lambda\)-imbedded into some space if two vertices of the imbedding are joined by an edge iff their distance is \(>\lambda\). In the paper it is proved: For every \(2>\lambda >\sqrt{2}\) there exists a triangle-free graph G that cannot be \(\lambda\)-imbedded into the d-sphere for any positive integer d.
0 references
lambda-embedding of graphs
0 references
triangle-free graph
0 references
d-sphere
0 references