Fetching the paper…
Reading the bibliography…
The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program.
S. Bochner, Hilbert distances and positive definite functions
1941
Earlier work this paper cites.
I.J. Schoenberg, Positive definite functions on spheres
1942
Earlier work this paper cites.
N.G. de Bruijn, P. Erdős, A colour problem for infinite graphs and a problem in the theory of relations
1951
Earlier work this paper cites.
G. Szegö, Orthogonal polynomials
1967
Earlier work this paper cites.
D.G. Larman, C.A. Rogers, The realization of distances within sets in Euclidean space
1972
Earlier work this paper cites.
P. Delsarte, An algebraic approach to the association schemes of coding theory
1973
Earlier work this paper cites.
P. Delsarte, J.M. Goethals, J.J. Seidel, Spherical codes and designs
1977
Earlier work this paper cites.
G.A. Kabatiansky, V.I. Levenshtein, Bounds for packings on a sphere and in space
1978
Earlier work this paper cites.
R.J. McEliece, E.R. Rodemich, H. C. Rumsey Jr., The Lovász bound and some generalizations
1978
Cited alongside, same era.
L. Lovász, On the Shannon capacity of a graph
1979
Cited alongside, same era.
A. Schrijver, A comparison of the Delsarte and Lovász bounds
1979
Cited alongside, same era.
K.J. Falconer, The realization of distances in measurable subsets covering ℝ n \mathbb{R}^{n}
1981
Cited alongside, same era.
P. Frankl, R.M. Wilson, Intersection theorems with geometric consequences
1981
Cited alongside, same era.
L. Lovász, Self-dual polytopes and the chromatic number of distance graphs on the sphere
1983
Cited alongside, same era.
N.Ja. Vilenkin, A.U. Klimyk, Representation of Lie groups and special functions, Volume 2
1993
Later among the works it cites.
D.E. Knuth, The sandwich theorem
1994
Later among the works it cites.
G.N. Watson, A treatise on the theory of Bessel function
1995
Later among the works it cites.
G.E. Andrews, R. Askey, R. Roy, Special functions
1999
Later among the works it cites.
A.M. Raigorodskii, On the chromatic number of a space
2000
Later among the works it cites.
L.A. Székely, Erdős on unit distances and the Szemerédi-Trotter theorems
2002
Later among the works it cites.
C. Bachoc, Linear programming bounds for codes in Grassmannian spaces
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Frankl, V. Rödl, Forbidden intersections
1987
Cited alongside, same era.
L.A. Székely, N.C. Wormald, Bounds on the measurable chromatic number of ℝ n \mathbb{R}^{n}
1989
Cited alongside, same era.
F. de Oliveira Filho, F. Vallentin, Fourier analysis, linear programming, and densities of distance avoiding sets in ℝ n \mathbb{R}^{n}
Cited in the paper.
2006
Later among the works it cites.