Triangle free graphs that are not \(\sqrt{3}\)-embeddable in \(S^ n\). (Q1172067): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(82)90069-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001480021 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4053693 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Systems of vectors in Euclidean space and an extremal problem for polynomials / 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 | |||
| Property / cites work | |||
| Property / cites work: On the Shannon capacity of a graph / rank | |||
Normal rank | |||
Latest revision as of 17:32, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangle free graphs that are not \(\sqrt{3}\)-embeddable in \(S^ n\). |
scientific article |
Statements
Triangle free graphs that are not \(\sqrt{3}\)-embeddable in \(S^ n\). (English)
0 references
1982
0 references
orthogonal representation of graphs
0 references
triangle free graph
0 references
