Back to Search
Start Over
On Algorithmic Methods of Analysis of Two-Colorings of Hypergraphs.
- Source :
-
Journal of Mathematical Sciences . Feb2016, Vol. 213 Issue 2, p211-229. 19p. - Publication Year :
- 2016
-
Abstract
- Abstract. This paper deals with an extremal problem concerning hypergraph colorings. Let k be an integer. The problem is to find the value m( 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 m( n) for small k and n, the exact value of m(8), and a lower bound for m(7). [ABSTRACT FROM AUTHOR]
- Subjects :
- *ALGORITHMS
*HYPERGRAPHS
*PROBLEM solving
*NUMBER theory
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 10723374
- Volume :
- 213
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Journal of Mathematical Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 112836900
- Full Text :
- https://doi.org/10.1007/s10958-016-2711-7