Russian Mathematical Surveys
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Russian Mathematical Surveys, 2011, Volume 66, Issue 5, Pages 933–1002
DOI: https://doi.org/10.1070/RM2011v066n05ABEH004764 (Mi rm9443) 		 
This article is cited in 39 scientific papers (total in 39 papers)

The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems

A. M. Raigorodskiiab, D. A. Shabanovab

a M. V. Lomonosov Moscow State University
b Moscow Institute of Physics and Technology
English version PDF (1028 kB) Citations (39) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/RM2011v066n05ABEH004764
Abstract: Extremal problems concerned with hypergraph colouring first arose in connection with classical investigations in the 1920-30s which gave rise to Ramsey theory. Since then, this area has assumed a central position in extremal combinatorics. This survey is devoted to one well-known problem of hypergraph colouring, the Erdős–Hajnal problem, initially posed in 1961. It opened a line of research in hypergraph theory whose methods and results are widely used in various domains of discrete mathematics.
Bibliography: 109 titles.
Keywords: hypergraph, hypergraph colourings, chromatic numbers, extremal set theory.
Received: 01.11.2010
Bibliographic databases:
Document Type: Article
UDC: 519.112.7+519.174+519.179.1
MSC: 05C15, 05C35, 05C65
Language: English
Original paper language: Russian
Citation: 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
Citation in format AMSBIB
\Bibitem{RaiSha11}
\by A.~M.~Raigorodskii, D.~A.~Shabanov
\paper The Erd\H os--Hajnal problem of hypergraph colouring, its generalizations, and related problems
\jour Russian Math. Surveys
\yr 2011
\vol 66
\issue 5
\pages 933--1002
\mathnet{http://mi.mathnet.ru//eng/rm9443}
\crossref{https://doi.org/10.1070/RM2011v066n05ABEH004764}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2919273}
\zmath{https://zbmath.org/?q=an:1251.05063}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2011RuMaS..66..933R}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000298661300003}
\elib{https://elibrary.ru/item.asp?id=20423298}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84855925923}
Linking options:
  • https://www.mathnet.ru/eng/rm9443
  • https://doi.org/10.1070/RM2011v066n05ABEH004764
  • https://www.mathnet.ru/eng/rm/v66/i5/p109
    • This publication is cited in the following 39 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Успехи математических наук Russian Mathematical Surveys
    Statistics & downloads:
    Abstract page:2014
    Russian version PDF:1076
    English version PDF:36
    References:98
    First page:52
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024