In mathematics, Property B is a certain set theoretic property. Formally, given a finite set X {\displaystyle X} , a collection C {\displaystyle C} of subsets of X {\displaystyle X} has Property B if we can partition X {\displaystyle X} into two disjoint subsets Y {\displaystyle Y} and Z {\displaystyle Z} such that every set in C {\displaystyle C} meets both Y {\displaystyle Y} and Z {\displaystyle Z} . The property gets its name from mathematician Felix Bernstein, who first introduced the property in 1908. Property B is equivalent to 2-coloring the hypergraph described by the collection C {\displaystyle C} . A hypergraph with property B is also called 2-colorable. Sometimes it is also called bipartite, by analogy to the bipartite graphs (see bipartite hypergraph). Property B is often studied for uniform hypergraphs (set systems in which all subsets of the system have the same cardinality) but it has also been considered in the non-uniform case. Some formulations use combinatorial designs, where the collection is a design, the sets are blocks, and the elements are points. The problem of checking whether a collection C {\displaystyle C} has Property B is called the set splitting problem.
Smallest collections without property B
The smallest number of sets in a collection of sets of size n {\displaystyle n} such that C {\displaystyle C} does not have Property B is denoted by m ( n ) {\displaystyle m(n)} .
Small values of m(n) For n = 1 , 2 , 3 , 4 {\displaystyle n=1,2,3,4} :
m ( n ) = 1 , 3 , 7 , 23 {\displaystyle m(n)=1,3,7,23} (sequence A392185 in the OEIS)
m ( 1 ) = 1 {\displaystyle m(1)=1} : For n = 1 {\displaystyle n=1} , set X = { 1 } {\displaystyle X=\{1\}} , and C = { { 1 } } {\displaystyle C=\{\{1\}\}} . Then C {\displaystyle C} does not have Property B.
m ( 2 ) = 3 {\displaystyle m(2)=3} : For n = 1 {\displaystyle n=1} , set X = { 1 , 2 , 3 } {\displaystyle X=\{1,2,3\}} and C = { { 1 , 2 } , { 1 , 3 } , { 2 , 3 } } {\displaystyle C=\{\{1,2\},\{1,3\},\{2,3\}\}} (a triangle). Then C {\displaystyle C} does not have Property B, so m ( 2 ) ≤ 3 {\displaystyle m(2)\leq 3} . However, for C ′ = { { 1 , 2 } , { 1 , 3 } } {\displaystyle C'=\{\{1,2\},\{1,3\}\}} , X {\displaystyle X} has a partition into sets Y = { 1 } {\displaystyle Y=\{1\}} and Z = { 2 , 3 } {\displaystyle Z=\{2,3\}} , so m ( 2 ) ≥ 3 {\displaystyle m(2)\geq 3} .
… excerpt ends here. Continue reading the full article.



