Property B

For the B-property in finite group theory, see B-theorem.

A 2-coloring of a hypergraph, equivalent to a collection C with Property B.

In mathematics, Property B is a certain set theoretic property. Formally, given a finite set X, a collection C of subsets of X has Property B if we can partition X into two disjoint subsets Y and Z such that every set in C meets both Y and Z.

The property gets its name from mathematician Felix Bernstein, who first introduced the property in 1908.[1]

Property B is equivalent to 2-coloring the hypergraph described by the collection C. A hypergraph with property B is also called 2-colorable.[2] 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.[3]

Some formulations use combinatorial designs, where the collection is a design, the sets are blocks, and the elements are points.[4]

The problem of checking whether a collection C has Property B is called the set splitting problem.

## Contents

* 1 Smallest collections without property B
* 1.1 Small values of m(n)
* 1.2 Asymptotics of m(n)
* 1.3 Other partial results
* 2 See also
* 3 Notes
* 4 References

## Smallest collections without property B

The Steiner triple system S7, the smallest 3-uniform collection that doesn't have property B. | Unsolved problem in mathematics:

What is the smallest collection of n-uniform sets without Property B for all n?

(more unsolved problems in mathematics)

|

The smallest number of sets in a collection of sets of size n such that C does not have Property B is denoted by m(n).

### Small values of m(n)

For n=1,2,3,4:

m(n)=1,3,7,23  (sequence A392185 in the OEIS)

m(1)=1:
For n=1, set X={1}, and C={{1}}. Then C does not have Property B.

m(2)=3:
For n=1, set X={1,2,3} and C={{1,2},{1,3},{2,3}} (a triangle). Then C does not have Property B, so m(2)≤3. However, for C′={{1,2},{1,3}}, X has a partition into sets Y={1} and Z={2,3}, so m(2)≥3.

m(3)=7:
For n=3, set X={1,2,3,4,5,6,7}, and C={{1,2,4},{2,3,5},{3,4,6},{4,5,7},{5,6,1},{6,7,2},{7,1,3}} (the Steiner triple system S7), C does not have Property B (so m(3)≤7), but if any element of C is omitted, then that element can be taken as Y, and the set of remaining elements C′ will have Property B (so for this particular case, m(3)≥7). One may check all other collections of 6 3-sets to see that all have Property B.

m(4)=23:
Östergård (2014)[4] through an exhaustive search found m(4)=23. Before, Seymour (1974)[5] constructed a hypergraph on 11 vertices with 23 edges without Property B, showing that m(4)≤23, and Manning in 1995[6] had narrowed the floor such that m(4)≥20, then to m(4)≥21 in 1997.[7]

29≤m(5)≤51:
The bounds for even the next unknown value are quite far apart. On the lower end, only collections with certain numbers of unique elements could potentially not have Property B, but this range grows larger further from the lower bound. The lower bound was improved from 28 to 29 in 2020.[8]

### Asymptotics of m(n)

Erdős (1963)[9] proved that for any collection of fewer than 2n−1 sets of size n, there exists a 2-coloring in which all set are bichromatic. The proof is simple: Consider a random coloring. The probability that an arbitrary set is monochromatic is 2−n+1. By a union bound, the probability that there exist a monochromatic set is less than 2n−12−n+1=1. Therefore, there exists a good coloring.

Erdős (1964)[10] showed the existence of an n-uniform hypergraph with O(2n⋅n2) hyperedges which does not have property B (i.e., does not have a 2-coloring in which all hyperedges are bichromatic), establishing an upper bound.

Schmidt (1964)[11] proved that every collection of at most n/(n+4)⋅2n sets of size n has property B. Erdős and Lovász conjectured that m(n)=θ(2n⋅n). Beck in 1978[3] improved the lower bound to m(n)=Ω(n1/3−ϵ2n), where ϵ is an arbitrary small positive number. In 2000,[12] Radhakrishnan and Srinivasan improved the lower bound to m(n)=Ω(2n⋅n/log⁡n) using a probabilistic algorithm.

### Other partial results

For a design without Property B, merging any pair of points not occurring in any block of the design creates another design without Property B. The search may thus be restricted to designs that cover all pairs of points, known as covering designs.[4]

## See also

* Sylvester–Gallai theorem § Colored points
* Set splitting problem

## Notes

1. ↑ Bernstein (1908).
2. ↑ Lovász & Plummer (1986).
3. ↑ 3.0 3.1 Beck (1978).
4. ↑ 4.0 4.1 4.2 Östergård (2014).
5. ↑ Seymour (1974). harv error: no target: CITEREFSeymour1974 (help)
6. ↑ Manning (1995).
7. ↑ Manning (1997).
8. ↑ Aglave et al. (2020).
9. ↑ Erdős (1963).
10. ↑ Erdős (1964).
11. ↑ Schmidt (1964).
12. ↑ Radhakrishnan & Srinivasan (2000).

## References

* Bernstein, F. (1908), "Zur theorie der trigonometrische Reihen", Leipz. Ber. 60: 325–328
* Miller, E. W. (1937), "On a property of families of sets", Comp. Rend. Varsovie 30: 31–38 .
* "On a property of families of sets", Acta Mathematica Academiae Scientiarum Hungaricae 12 (1–2): 87–123, 1961, doi:10.1007/BF02066676 .
* Erdős, Paul (1963), "On a combinatorial problem", Nordisk Mat. Tidskr. 11: 5–10
* Erdős, Paul (1964). "On a combinatorial problem. II". Acta Mathematica Academiae Scientiarum Hungaricae 15 (3–4): 445–447. doi:10.1007/BF01897152.
* Schmidt, W. M. (1964). "Ein kombinatorisches Problem von P. Erdős und A. Hajnal". Acta Mathematica Academiae Scientiarum Hungaricae 15 (3–4): 373–374. doi:10.1007/BF01897145.
* Abbott, H. L.; Hanson, D. (1969), "On a combinatorial problem of Erdös", Canadian Mathematical Bulletin 12 (6): 823–829, doi:10.4153/CMB-1969-107-x
* "A note on a combinatorial problem of Erdős and Hajnal", Bulletin of the London Mathematical Society 8 (4): 681–682, 1974, doi:10.1112/jlms/s2-8.4.681 .
* Toft, Bjarne (1975), "On colour-critical hypergraphs", Infinite and Finite Sets: To Paul Erdös on His 60th Birthday, North Holland Publishing Co., pp. 1445–1457 .
* Beck, J. (1978), "On 3-chromatic hypergraphs", Discrete Mathematics 24 (2): 127–137, doi:10.1016/0012-365X(78)90191-7 .
* Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, 29, North-Holland, p. 468, ISBN 0-444-87916-1
* Manning, G. M. (1995), "Some results on the m(4) problem of Erdős and Hajnal", Electronic Research Announcements of the American Mathematical Society 1 (3): 112–113, doi:10.1090/S1079-6762-95-03004-6 .
* Manning, G. M. (1997), The M(4) problem of Erdős and Hajnal, Northern Illinois University, https://dl.acm.org/doi/10.5555/287306 .
* Radhakrishnan, J.; Srinivasan, A. (2000), "Improved bounds and algorithms for hypergraph 2-coloring", Random Structures and Algorithms 16 (1): 4–32, doi:10.1002/(SICI)1098-2418(200001)16:1<4::AID-RSA2>3.0.CO;2-2, https://ieeexplore.ieee.org/document/743519 .
* Östergård, Patric R. J. (30 January 2014). "On the minimum size of 4-uniform hypergraphs without property B". Discrete Applied Mathematics 163, Part 2: 199–204. doi:10.1016/j.dam.2011.11.035.
* Aglave, Sachin; Amarnath, V. A.; Shannigrahi, Saswata; Singh, Shwetank (2020). "Improved bounds for uniform hypergraphs without property B". Australasian Journal of Combinatorics 76 (1): 73–86. ISSN 2202-3518. https://ajc.maths.uq.edu.au/pdf/76/ajc_v76_p073.pdf.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Property B. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Property_B&oldid=4296574"