RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Dokl. Akad. Nauk, 2009, Volume 426, Number 2, Pages 177–178 (Mi dan71)  

This article is cited in 1 scientific paper (total in 1 paper)

Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

D. A. Shabanov



English version:
Doklady Mathematics, 2009, 79:3, 349–350

Bibliographic databases:


Linking options:
  • http://mi.mathnet.ru/eng/dan71

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems”, Russian Math. Surveys, 66:5 (2011), 933–1002  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
  • Number of views:
    This page:13

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017