Skip to main content
Log in

A certain combinatorial inequality

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. P. Erdös and J. H. Spencer, Probabilistic Methods in Combinatorics. Probability and Mathematical Statistics, Vol. 17, Academic Press, New York-London (1974).

    Google Scholar 

  2. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass. (1969).

    Google Scholar 

  3. V. L. Dol'nikov, “On transversals of families of sets,” in: Studies in the Theory of Functions of Several Real Variables [in Russian], Yaroslavl State Univ. (1981), pp. 30–36.

  4. O. Ore, Theory of Graphs, Am. Math. Soc., Providence, R. I. (1962).

    Google Scholar 

  5. P. Turan, “Egy grafelmeleti szelsöertek felada-trol,” Math. Fiz. Lapok,48, 436–452 (1941).

    Google Scholar 

  6. L. Lovasz, “Kneser's conjecture, chromatic number and homotopy,” J. Combin. Theory,25, No. 3, 319–324 (1978).

    Google Scholar 

  7. M. Kneser, Aufgabe 360, Jber Deutsch. Math.-Verein,58, No. 2 (1955).

Download references

Authors

Additional information

Dnepropetrovsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 29, No. 3, pp. 53–58, May–June, 1988.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dol'nikov, V.L. A certain combinatorial inequality. Sib Math J 29, 375–379 (1988). https://doi.org/10.1007/BF00969645

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00969645

Navigation