Problems of Information Transmission

, Volume 54, Issue 1, pp 56–69 | Cite as

General Independence Sets in Random Strongly Sparse Hypergraphs

Large Systems


We analyze the asymptotic behavior of the j-independence number of a random k-uniform hypergraph H(n, k, p) in the binomial model. We prove that in the strongly sparse case, i.e., where \(p = c/\left( \begin{gathered} n - 1 \hfill \\ k - 1 \hfill \\ \end{gathered} \right)\) for a positive constant 0 < c ≤ 1/(k − 1), there exists a constant γ(k, j, c) > 0 such that the j-independence number α j (H(n, k, p)) obeys the law of large numbers \(\frac{{{\alpha _j}\left( {H\left( {n,k,p} \right)} \right)}}{n}\xrightarrow{P}\gamma \left( {k,j,c} \right)asn \to + \infty \) Moreover, we explicitly present γ(k, j, c) as a function of a solution of some transcendental equation.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sidorenko, A.F., What We Know and What We Do Not Know about Turán Numbers, Graphs Combin., 1995, vol. 11, no. 2, pp. 179–199.MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Cutler, J. and Radcliffe, A.J., Hypergraph Independent Sets, Combin. Probab. Comput., 2013, vol. 22, no. 1, pp. 9–20.MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Janson, S., Łuczak, T., and Ruciński, A., Random Graphs, New York: Wiley, 2000.CrossRefMATHGoogle Scholar
  4. 4.
    Wormald, N.C., Models of Random Regular Graphs, Surveys in Combinatorics, 1999, Lamb, J.D. and Preece, D.A., Eds., London Math. Soc. Lecture Note Ser., vol. 267, Cambridge: Cambridge Univ. Press, 1999, pp. 239–298.MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Bayati, M., Gamarnik, D., and Tetali, P., Combinatorial Approach to the Interpolation Method and Scaling Limits in Sparse Random Graphs, Ann. Probab., 2013, vol. 41, no. 6, pp. 4080–4115.MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Karp, R.M. and Sipser, M., Maximum Matchings in Sparse Random Graphs, in Proc. 22nd Annual Sympos. on Foundations of Computer Science (SFCS’81), Oct. 28–30, 1981, Nashville, TN, USA, pp. 364–375.Google Scholar
  7. 7.
    Krivelevich, M. and Sudakov, B., The Chromatic Numbers of Random Hypergraphs, Random Struct. Algor., 1998, vol. 12, no. 4, pp. 381–403.MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Schmidt, J.P., Probabilistic Analysis of Strong Hypergraph Coloring Algorithms and the Strong Chromatic Number, Discrete Math., 1987, vol. 66, no. 3, pp. 259–277.MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Shamir, E., Chromatic Number of Random Hypergraphs and Associated Graphs, Randomness and Computation, Micali, S., Ed., Adv. Comput. Res., vol. 5, Greenwich, CT: JAI Press, 1989, pp. 127–142.Google Scholar
  10. 10.
    Semenov, A.S. and Shabanov, D.A., Independence Numbers of Random Sparse Hypergraphs, Diskret. Mat., 2016, vol. 28, no. 3, pp. 126–144 [Discrete Math. Appl. (Engl. Transl.), 2017, vol. 27, no. 4, pp. 231–245].CrossRefMATHGoogle Scholar
  11. 11.
    Schmidt-Pruzan, J. and Shamir, E. Component Structure in the Evolution of Random Hypergraphs, Combinatorica, 1985, vol. 5, no. 1, pp. 81–94.MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Bollobás, B., Random Graphs, Cambridge: Cambridge Univ. Press, 2001, 2nd ed.CrossRefMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2018

Authors and Affiliations

  1. 1.Department of Probability Theory, Faculty of Mechanics and MathematicsLomonosov Moscow State UniversityMoscowRussia
  2. 2.Chair of Discrete Mathematics, Department of Innovation and High TechnologyMoscow Institute of Physics and Technology (State University)MoscowRussia
  3. 3.Laboratory of Advanced Combinatorics and Network ApplicationsMoscow Institute of Physics and Technology (State University)MoscowRussia

Personalised recommendations