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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Fundam. Prikl. Mat., 2009, Volume 15, Issue 7, Pages 141–163 (Mi fpm1275)  

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

On balanced colorings of hypergraphs

A. P. Rozovskaya, M. V. Titova, D. A. Shabanov

M. V. Lomonosov Moscow State University

Abstract: The paper deals with an extremal problem concerning hypergraph colorings. Let $k$ be an integer. The problem is to find the value $m_k(n)$ equal to the minimum number of edges in an $n$-uniform hypergraph not admitting two-colorings of the vertex set such that every edge of the hypergraph contains $k$ vertices of each color. In this paper, we obtain the exact values of $m_2(5)$ and $m_2(4)$, and the upper bounds for $m_3(7)$ and $m_4(9)$.

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

English version:
Journal of Mathematical Sciences (New York), 2010, 169:5, 654–670

Bibliographic databases:

UDC: 519.179.1+519.157

Citation: A. P. Rozovskaya, M. V. Titova, D. A. Shabanov, “On balanced colorings of hypergraphs”, Fundam. Prikl. Mat., 15:7 (2009), 141–163; J. Math. Sci., 169:5 (2010), 654–670

Citation in format AMSBIB
\Bibitem{RozTitSha09}
\by A.~P.~Rozovskaya, M.~V.~Titova, D.~A.~Shabanov
\paper On balanced colorings of hypergraphs
\jour Fundam. Prikl. Mat.
\yr 2009
\vol 15
\issue 7
\pages 141--163
\mathnet{http://mi.mathnet.ru/fpm1275}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2745007}
\elib{http://elibrary.ru/item.asp?id=15340717}
\transl
\jour J. Math. Sci.
\yr 2010
\vol 169
\issue 5
\pages 654--670
\crossref{https://doi.org/10.1007/s10958-010-0067-y}
\elib{http://elibrary.ru/item.asp?id=15335016}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77956058873}


Linking options:
  • http://mi.mathnet.ru/eng/fpm1275
  • http://mi.mathnet.ru/eng/fpm/v15/i7/p141

    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. Cherkashin D.D., Kulikov A.B., “On two-colorings of hypergraphs”, Dokl. Math., 83:1 (2011), 68–71  crossref  mathscinet  zmath  isi  elib  elib
    2. Teplyakov S.M., “Rekurrentnye verkhnie otsenki v zadache Erdesha-Khainala o raskraske gipergrafa i v ee obobscheniyakh”, Trudy Moskovskogo fiziko-tekhnicheskogo instituta, 4:1-13 (2012), 141–150  elib
    3. A. V. Lebedeva, “On algorithmic methods of analysis of two-colorings of hypergraphs”, J. Math. Sci., 213:2 (2016), 211–229  mathnet  crossref  mathscinet
  • Фундаментальная и прикладная математика
    Number of views:
    This page:274
    Full text:107
    References:33
    First page:1

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