Email this article On Algorithmic Methods of Analysis of Two-Colorings of Hypergraphs
- Authors: Lebedeva A.V.1
-
Affiliations:
- Moscow State University
- Issue: Vol 213, No 2 (2016)
- Pages: 211-229
- Section: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/237159
- DOI: https://doi.org/10.1007/s10958-016-2711-7
- ID: 237159
Cite item
Open Access
Access granted
Subscription Access
Abstract
Abstract. This paper deals with an extremal problem concerning hypergraph colorings. Let k be an integer. The problem is to find the value mk(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 at least k vertices of each color. In this paper, we obtain upper bounds of mk(n) for small k and n, the exact value of m4(8), and a lower bound for m3(7).
About the authors
A. V. Lebedeva
Moscow State University
Author for correspondence.
Email: anuta278@yandex.ru
Russian Federation, Moscow
Supplementary files
