Publication | Closed Access
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
48
Citations
4
References
1997
Year
Geometry Of NumberGeometric Graph TheoryComputational Complexity TheoryEngineeringGraph TheoryMany EdgesAlgebraic Graph TheoryTopological Graph TheoryGilbert-varshamov BoundLower BoundPlanar GraphComputational ComplexityGeneralized Gilbert-varshamov BoundSlight ImprovementComputer ScienceDiscrete MathematicsExtremal Graph TheoryVariable-length Code
The generalization of the Gilbert-Varshamov bound due to Gu and Fuja (1993) is a direct consequence of Turan's theorem on the existence of a clique in a graph with many edges. Turan's theorem allows a slight improvement of Gu and Fuja's result. This improved generalized Gilbert-Varshamov bound is in fact equivalent to Turan's theorem.
| Year | Citations | |
|---|---|---|
Page 1
Page 1