The extremal problem of hypergraph colorings related to the Erdős–Hajnal property B-problem is considered. Let k be a natural number. The problem is to find the value of mk(n) equal to the minimal number of edges in an n-uniform hypergraph that does not admit 2-colorings of the vertex set such that every edge of the hypergraph contains at least k vertices of each color. In this paper, e obtain new lower bounds for m(n).
|Number of pages
|Fundamental and Applied Mathematics
|Published - 2020
Bibliographical notePublisher Copyright:
© 2020 National Open University "INTUIT".
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Applied Mathematics