Literature cited
P. Turán, “On some applications of graph theory to analysis,” in: Proc. Conf. Constr. Function Theory, May 19–25, 1970, Varna; Sofia (1972), pp. 351–358.
P. Turán, “Applications of graph theory to geometry and potential theory,” in: Combinatorial Structures and Their Applications, Gordon and Breach, New York (1970), pp. 423–434.
V. T. Sós, “On extremal problems in graph theory,” in: Combinatorial Structures and Their Applications, Gordon and Breach, New York (1970), pp. 407–410.
Gy. Katona, “Grafok, vektorok 6s,” Mat. Lapok,20, Nos. 1–2, 123–127 (1969).
B. S. Stechkin, “Some combinatorial problems,” Zb. Radova Mat. Inst., Nova Ser., Belgrad,2, 129–137 (1977).
D. Katona and B. S. Stechkin, “Combinatorial numbers, geometric constants, and probabilistic inequalities,” Dokl. Akad. Nauk SSSR,251, No. 6, 1293–1296 (1980).
D. Katona, “Inequalities for the distribution of the length of a sum of random vectors,” Teor. Veroyatn. Primen.,22, No. 3, 466–481 (1977).
P. Erdos and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press (1974).
A. F. Sidorenko, “Classes of hypergraphs and probabilistic inequalities,” Dokl. Akad. Nauk SSSR,254, No. 3, 540–543 (1980).
P. J. Cameron and J. H. van Lint, Graph Theory, Coding Theory and Block Designs, Cambridge Univ. Press (1975).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 29, No. 5, pp. 691–709, May, 1981.
Rights and permissions
About this article
Cite this article
Sidorenko, A.F., Stechkin, B.S. Extremal geometric constants. Mathematical Notes of the Academy of Sciences of the USSR 29, 352–361 (1981). https://doi.org/10.1007/BF01158359
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01158359