Orthonormal Representations of H-Free Graphs
- 9 March 2020
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 64 (3) , 654-670
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- SNSF (200021-175573)
- Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zurich Foundation
This publication has 24 references indexed in Scilit:
- Perturbed Identity Matrices Have High Rank: Proof and ApplicationsCombinatorics, Probability and Computing, 2009
- Cycles of Nonzero Elements in Low Rank MatricesCombinatorica, 2002
- Some structural properties of low-rank matrices related to computational complexityTheoretical Computer Science, 2000
- Approximating the independence number via theϑ-functionMathematical Programming, 1998
- New Asymptotics for Bipartite Turán NumbersJournal of Combinatorial Theory, Series A, 1996
- Orthogonal representations and connectivity of graphsLinear Algebra and its Applications, 1989
- 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
- On cycle—Complete graph ramsey numbersJournal of Graph Theory, 1978
- Cycles of even length in graphsJournal of Combinatorial Theory, Series B, 1974