Independence numbers of random sparse hypergraphs
-
Aleksandr S. Semenov
und
Dmitriy. A. Shabanov
Abstract
The paper is concerned with the asymptotic behaviour of the independence number for the binomial model of a random k-regular hypergraph H(n, k, p) in a sparse case, when
with some constant γ(c) > 0. We also shows that γ (c) > 0 is a solution of some transcendental equation for small values of c ⩽ (k - 1)-1.
Originally published in Diskretnaya Matematika (2016) 28, №3, 126–144 (in Russian).
Funding: This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 15-01-03530-a) and a grant of the President of the Russian Federation for Support of Young Doctors of the Sciences (grant no. MD-5650.2016.1).
References
[1] Matula D.W., “On the complete subgraphs of a random graph”, In: Combinatory Mathematics and its applications, Chapel Hill, 1970, 356-369.Suche in Google Scholar
[2] Grimmett G., McDiarmid C., “On colouring random graphs”, Math. Proc. Cambr. Phil. Soc., 77 (1975), 313-325.10.1017/S0305004100051124Suche in Google Scholar
[3] Bollobás B., Erdős P., “Cliques in random graphs”, Math. Proc. Cambr. Phil. Soc., 80 (1976), 419-427.10.1017/S0305004100053056Suche in Google Scholar
[4] Frieze A., “On the independence number of random graphs”, Discrete Mathematics, 81 (1990), 171-175.10.1016/0012-365X(90)90149-CSuche in Google Scholar
[5] Wormald N., “Models of random regular graphs”, Surveys in Combinatorics, London Math. Soc. Lec. Notes Ser., 267, Cambridge Univ. Press, Cambridge, 1999, 239-298.10.1017/CBO9780511721335.010Suche in Google Scholar
[6] Bayati M., Gamarnik D., Tetali P., “Combinatorial approach to the interpolation method and scaling limits in sparse random graphs”, Ann. Probab., 41:6 (2013), 4080-4015.10.1145/1806689.1806706Suche in Google Scholar
[7] Karp R., Sipser M., “Maximum matchings in sparse random graphs”, 22nd Ann. Symp. on Found. Computer Sci., 1981, 364-375.10.1109/SFCS.1981.21Suche in Google Scholar
[8] Ding J., Sly A., Sun N., Maximum independent sets on random regular graphs, arXiv: 1310.4787.10.1007/s11511-017-0145-9Suche in Google Scholar
[9] Krivelevich M., Sudakov B., “The chromatic numbers of random hypergraphs”, Random Structures and Algorithms, 12 (1998), 381-403.10.1002/(SICI)1098-2418(199807)12:4<381::AID-RSA5>3.0.CO;2-PSuche in Google Scholar
[10] Bollobás B., Random Graphs, Cambridge Univ. Press, Cambridge, 2002.10.1017/CBO9780511814068Suche in Google Scholar
[11] Schmidt-Pruzan J., Shamir E., “Component structures in the evolution of random hypergraphs”, Combinatorica, 5:1 (1985), 81-94.10.1007/BF02579445Suche in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Estimates of the number of (k, l)-sumsets in the finite Abelian group
- Independence numbers of random sparse hypergraphs
- Steganographic capacity for one-dimensional Markov cover
Artikel in diesem Heft
- Frontmatter
- Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Estimates of the number of (k, l)-sumsets in the finite Abelian group
- Independence numbers of random sparse hypergraphs
- Steganographic capacity for one-dimensional Markov cover
