RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Mat. Zametki, 2009, Volume 85, Issue 6, Pages 951–954 (Mi mz7662)  

This article is cited in 8 scientific papers (total in 8 papers)

Brief Communications

On the Chromatic Number of Finite Systems of Subsets

D. A. Shabanov

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Keywords: $n$-uniform hypergraph, chromatic number, randomized algorithm, random coloring method

DOI: https://doi.org/10.4213/mzm7662

Full text: PDF file (286 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 2009, 85:6, 902–905

Bibliographic databases:

Received: 08.09.2008

Citation: D. A. Shabanov, “On the Chromatic Number of Finite Systems of Subsets”, Mat. Zametki, 85:6 (2009), 951–954; Math. Notes, 85:6 (2009), 902–905

Citation in format AMSBIB
\Bibitem{Sha09}
\by D.~A.~Shabanov
\paper On the Chromatic Number of Finite Systems of Subsets
\jour Mat. Zametki
\yr 2009
\vol 85
\issue 6
\pages 951--954
\mathnet{http://mi.mathnet.ru/mz7662}
\crossref{https://doi.org/10.4213/mzm7662}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2572848}
\zmath{https://zbmath.org/?q=an:1191.05044}
\transl
\jour Math. Notes
\yr 2009
\vol 85
\issue 6
\pages 902--905
\crossref{https://doi.org/10.1134/S0001434609050332}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000267684500033}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-70049094232}


Linking options:
  • http://mi.mathnet.ru/eng/mz7662
  • https://doi.org/10.4213/mzm7662
  • http://mi.mathnet.ru/eng/mz/v85/i6/p951

    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. D. A. Shabanov, “On the Lower Bound for van der Waerden Functions”, Math. Notes, 87:6 (2010), 918–920  mathnet  crossref  crossref  mathscinet  isi  elib
    2. Shabanov D.A., “Lower bounds for the number of edges in hypergraphs of certain classes”, Dokl. Math., 82:2 (2010), 705–708  crossref  mathscinet  zmath  isi  elib  elib
    3. Shabanov D.A., “Lower bounds in the combinatorial problem of Erdős and Lovász”, Dokl. Math., 81:2 (2010), 286–288  crossref  mathscinet  zmath  isi  elib  elib
    4. D. A. Shabanov, “Van der Waerden's function and colourings of hypergraphs”, Izv. Math., 75:5 (2011), 1063–1091  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    5. 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
    6. Shabanov D.A., “Random coloring method in the combinatorial problem of Erdős and Lovász”, Random Structures Algorithms, 40:2 (2012), 227–253  crossref  mathscinet  zmath  isi
    7. Shabanov D.A., “On $r$-chromatic hypergraphs”, Discrete Math., 312:2 (2012), 441–458  crossref  mathscinet  zmath  isi  elib
    8. D. A. Shabanov, “Coloring non-uniform hypergraphs without short cycles”, Graphs Comb., 30:5 (2014), 1249–1260  crossref  mathscinet  zmath  isi
  • Математические заметки Mathematical Notes
    Number of views:
    This page:211
    Full text:30
    References:16
    First page:12

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