Triangle free graphs that are not 3-embeddable in Sd
- 1 October 1982
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 33 (2) , 191-195
- https://doi.org/10.1016/0095-8956(82)90069-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Systems of vectors in Euclidean space and an extremal problem for polynomialsMathematical Notes, 1981
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- A triangle free graph which cannot be
3 Journal of Combinatorial Theory, Series A, 1978