Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 1989, Volume 1, Issue 3, Pages 47–52 (Mi dm922)  
Extremal problems for $k$-colored graphs and unimprovable inequalities for pairs of random elements

A. F. Sidorenko
Full-text PDF (698 kB)
Received: 25.11.1988
Bibliographic databases:
UDC: 519.1+519.2
Language: Russian
Citation: A. F. Sidorenko, “Extremal problems for $k$-colored graphs and unimprovable inequalities for pairs of random elements”, Diskr. Mat., 1:3 (1989), 47–52; Discrete Math. Appl., 1:3 (1991), 271–277
Citation in format AMSBIB
\Bibitem{Sid89}
\by A.~F.~Sidorenko
\paper Extremal problems for $k$-colored graphs and unimprovable inequalities for pairs of random elements
\jour Diskr. Mat.
\yr 1989
\vol 1
\issue 3
\pages 47--52
\mathnet{http://mi.mathnet.ru/dm922}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1044235}
\zmath{https://zbmath.org/?q=an:0739.05051|0718.05027}
\transl
\jour Discrete Math. Appl.
\yr 1991
\vol 1
\issue 3
\pages 271--277
Linking options:
  • https://www.mathnet.ru/eng/dm922
  • https://www.mathnet.ru/eng/dm/v1/i3/p47
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:253
    Full-text PDF :120
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024