Journal of Mathematical Sciences

, Volume 169, Issue 5, pp 654–670 | Cite as

On balanced colorings of hypergraphs

  • A. P. Rozovskaya
  • M. V. Titova
  • D. A. Shabanov
Article
First Online:

Abstract

This 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).

Keywords

Common Vertex Vertex Coloring Vertex Number Balance Coloring Blue Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. L. Abbott and D. R. Hare, “Families of 4-sets without property B,” Ars Combinatoria, 60, 239–245 (2001).MathSciNetMATHGoogle Scholar
  2. 2.
    H. L. Abbott and A. Liu, “On property B of families of sets,” Can. Math. Bull., 23, 429–435 (1980).MathSciNetMATHGoogle Scholar
  3. 3.
    J. Beck, “On 3-chromatic hypergraphs,” Discrete Math., 24, 127–137 (1978).CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    P. Erdős, “On a combinatorial problem. I,” Nordisk Mat. Tidskr., 11, 5–10 (1963).MathSciNetGoogle Scholar
  5. 5.
    P. Erdős, “On a combinatorial problem. II,” Acta Math. Acad. Sci. Hung., 15, 445–447 (1964).CrossRefGoogle Scholar
  6. 6.
    P. Erdős and A. Hajnal, “On a property of families of sets,” Acta Math. Acad. Sci. Hung., 12, 87–123 (1961).CrossRefGoogle Scholar
  7. 7.
    G. Exoo, “On constructing hypergraphs without property B,” Ars Combinatoria, 30, 3–12 (1990).MathSciNetMATHGoogle Scholar
  8. 8.
    M. Goldberg and H. Russell, “Toward Computing m(4),” Ars Combinatoria, 39, 139–148 (1995).MathSciNetMATHGoogle Scholar
  9. 9.
    G. M. Manning, “Some results on the m(4) problem of Erdős and Hajnal,” Electron. Res. Announc. Am. Math. Soc., 1, 112–113 (1995).CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    J. Radhakrishnan and A. Srinivasan, “Improved bounds and algorithms for hypergraph two-coloring,” Random Structures Algorithms, 16, 4–32 (2000).CrossRefMathSciNetMATHGoogle Scholar
  11. 11.
    A. P. Rozovskaya, “On general two-colorings of uniform hypergraphs,” Dokl. Math., 80, No. 3, 837–839 (2009).CrossRefMathSciNetMATHGoogle Scholar
  12. 12.
    D. A. Shabanov, “On one combinatorial problem of Erdős,” Dokl. Math., 69, No. 3, 359–362 (2004).MATHGoogle Scholar
  13. 13.
    D. A. Shabanov, “Extremal problems for colorings of uniform hypergraphs,” Izv. Math., 71, No. 6, 1253–1290 (2007).CrossRefMathSciNetMATHGoogle Scholar
  14. 14.
    D. A. Shabanov, “Randomized algorithms for colorings of hypergraphs,” Sb. Math., 199, No. 7, 1089–1110 (2008).CrossRefMathSciNetGoogle Scholar
  15. 15.
    P. D. Seymour, “A note on combinatorial problem of Erdős and Hajnal,” J. London Math. Soc., 8, 681–682 (1974).CrossRefMathSciNetMATHGoogle Scholar
  16. 16.
    B. Toft, “On color critical hypergraphs,” in: A. Hajnal, ed., Infinite and Finite Sets, North-Holland, Amsterdam (1975), pp. 1445–1457.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2010

Authors and Affiliations

  • A. P. Rozovskaya
    • 1
  • M. V. Titova
    • 1
  • D. A. Shabanov
    • 1
  1. 1.Moscow State UniversityMoscowRussia

Personalised recommendations