Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved Bounds for Uniform Hypergraphs without Property B   A hypergraph is said to be properly 2-colorable if there exists a 2-coloring
of its vertices such that no hyperedge is monochromatic. On the other hand, a
hypergraph is called non-2-colorable if there exists at least one monochromatic
hyperedge in each of the possible 2-colorings of its vertex set. Let m(n)
denote the minimum number of hyperedges in a non-2-colorable n-uniform
hypergraph. Establishing the lower and upper bounds on m(n) is a well-studied
research direction over several decades. In this paper, we present new
constructions for non-2-colorable n-uniform hypergraphs. These constructions
improve the upper bounds for m(8), m(13), m(14), m(16) and m(17). We also
improve the lower bound for m(5).

29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
1
The categories of this paper are: cs
25
The categories of this paper are: patt-sol
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat
33
The categories of this paper are: plasm-ph