On two intersecting set systems and k-continuous boolean functions

@article{Tuza1987OnTI,
  title={On two intersecting set systems and k-continuous boolean functions},
  author={Zsolt Tuza},
  journal={Discrete Applied Mathematics},
  year={1987},
  volume={16},
  pages={183-185}
}
(A Boolean function f : { 0 , 1 }n~{0 , 1} is called k-continuous if for every x = (Xl, . . . , xn) E {0, 1 }n there exists a sequence 1 _ il < --" < ik < n such that f ( x ) = f ( y ) for all Y=(Yl, . . . ,Yn)e {0, 1} n with yil=xi,, ...,yik=Xik.) There was a gap, however, between the orders of magnitude of the upper and lower bound for m(k, k). Consider now two set systems ~¢= {A 1, ... ,An} and ~ = {B 1, ... ,Bn} of the same cardinality and with the following properties. 

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Critical hypergraphs and intersecting set-pair systems

J. Comb. Theory, Ser. B • 1985
View 3 Excerpts

The method of set-pairs for extremai problems in hypergraphs

Zs. Tuza
Finite and Infinite Sets, Coll. Math. Soc. J~inos Bolyai • 1981
View 1 Excerpt

Graphs and Hypergraphs

C. Berge
1973
View 2 Excerpts

Interpolation of functions over a measure space and conjectures about memory

A. Ehrenfeucht, J. Mycielski
J. Approx. Theory 9 • 1973
View 1 Excerpt

Theorem on families of sets

M. Calczyfiska-Karlowicz
Bull. Acad. Polon. Sci. Set. Math. Astron. Phys. 12 • 1964
View 1 Excerpt

Similar Papers

Loading similar papers…