{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:20:47Z","timestamp":1787322047520,"version":"build-2736575974"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>In this paper we study the behavior of the domination number of the Erd\u00f6s--R\u00e9nyi random graph $\\mathcal{G}(n,p)$. Extending a result of Wieland and Godbole we show that the domination number of $\\mathcal{G}(n,p)$ is equal to one of two values asymptotically almost surely whenever $p \\gg \\frac{\\ln^2n}{\\sqrt{n}}$. The explicit values are exactly at the first moment threshold, that is, where the expected number of dominating sets starts to tend to infinity. For small $p$ we also provide various nonconcentration results which indicate why some sort of lower bound on the probability $p$ is necessary in our first theorem. Concentration, though not on a constant length interval, is proven for every $p\\gg 1\/n$. These results show that unlike in the case of $p \\gg \\frac{\\ln^2n}{\\sqrt{n}}$, where concentration of the domination number happens around the first moment threshold, for $p = O( \\ln n\/n)$ it does so around the median. In particular, in this range the two are far apart from each other.<\/jats:p>","DOI":"10.1137\/12090054x","type":"journal-article","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T16:01:39Z","timestamp":1437062499000},"page":"1186-1206","source":"Crossref","is-referenced-by-count":15,"title":["On the Concentration of the Domination Number of the Random Graph"],"prefix":"10.1137","volume":"29","author":[{"given":"Roman","family":"Glebov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anita","family":"Liebenau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.1335"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215914"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"N. Alon and J. H. Spencer,\n                      The Probabilistic Method\n                      , Wiley-Interscience, New York, 2008.","DOI":"10.1002\/9780470277331"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122551"},{"key":"atypb5","unstructured":"B. Bolloba\u0301s,\n                      Random Graphs\n                      , Cambridge Stud. Adv. Math. 73, Cambridge University Press, Cambridge, UK, 2001."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.11.009"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"A. Coja-Oghlan and D. Vilenchik,\n                      Chasing the $k$-colorability threshold\n                      , in Proceedings of the 54th Annual Symposium on Foundations of Computer Science (FOCS), 2013.","DOI":"10.1109\/FOCS.2013.48"},{"key":"atypb8","unstructured":"P. A. Dreyer, Jr.\n                      Applications and Variations of Domination in Graphs\n                      , Ph.D. thesis, Rutgers University, New Brunswick, NJ, 2000."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90149-C"},{"key":"atypb10","unstructured":"M. R. Garey and D. S. Johnson,\n                      Computers and Intractability: A Guide to $NP$-Completeness\n                      , William H. Freeman, New York, 1979."},{"key":"atypb11","unstructured":"T. W. Haynes, S. Hedetniemi, and P. Slater,\n                      Fundamentals of Domination in Graphs\n                      , CRC Press, Boca Raton, FL, 1998."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01375472"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01205080"},{"key":"atypb14","first-page":"89","volume":"19","author":"Matula D. W.","year":"1972","journal-title":"Notices Amer. Math. Soc."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2283-3"},{"key":"atypb16","first-page":"1","author":"Nikoletseas S.","year":"1994","journal-title":"New York"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579208"},{"key":"atypb18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.37236\/1581","volume":"8","author":"Wieland B.","year":"2001","journal-title":"Electron. J. Combin."}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/12090054X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:17:29Z","timestamp":1787318249000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/12090054X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/12090054X"],"URL":"https:\/\/doi.org\/10.1137\/12090054x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}