@article{Toman_Olejár_Stanek_2012, title={Average Degree in the Interval Graph of a Random Boolean Function}, volume={27}, url={https://www.cai.sk/ojs/index.php/cai/article/view/235}, abstractNote={We consider an n-ary random Boolean function f such that for and study its geometric model, the so called interval graph. The interval graph of a Boolean function was introduced by Sapozhenko and has been used in construction of schemes realizing Boolean functions. Using this model, we estimate the number of maximal intervals intersecting a given maximal interval of a random Boolean function and prove that the asymptotic bound on the logarithm of the number is , where ?(n) ? 0 as .}, number={4}, journal={COMPUTING AND INFORMATICS}, author={Toman, Eduard and Olejár, Daniel and Stanek, Martin}, year={2012}, month={Jan.}, pages={627–638} }