Gao, Pu The number of perfect matchings, and the nesting properties, of random regular graphs. (English) Zbl 1525.05171 Random Struct. Algorithms 62, No. 4, 935-955 (2023). MSC: 05C80 05C70 PDFBibTeX XMLCite \textit{P. Gao}, Random Struct. Algorithms 62, No. 4, 935--955 (2023; Zbl 1525.05171) Full Text: DOI arXiv
Espuny Díaz, Alberto; Girão, António Hamiltonicity of graphs perturbed by a random regular graph. (English) Zbl 1525.05100 Random Struct. Algorithms 62, No. 4, 857-886 (2023). MSC: 05C45 05C80 05C38 PDFBibTeX XMLCite \textit{A. Espuny Díaz} and \textit{A. Girão}, Random Struct. Algorithms 62, No. 4, 857--886 (2023; Zbl 1525.05100) Full Text: DOI arXiv OA License
Sarid, Amir The spectral gap of random regular graphs. (English) Zbl 1525.05174 Random Struct. Algorithms 63, No. 2, 557-587 (2023). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C80 05C50 05B20 15B52 05C48 PDFBibTeX XMLCite \textit{A. Sarid}, Random Struct. Algorithms 63, No. 2, 557--587 (2023; Zbl 1525.05174) Full Text: DOI arXiv OA License
Mathieu, Claire; Zhou, Hang A simple algorithm for graph reconstruction. (English) Zbl 07751063 Random Struct. Algorithms 63, No. 2, 512-532 (2023). MSC: 68-XX 05-XX PDFBibTeX XMLCite \textit{C. Mathieu} and \textit{H. Zhou}, Random Struct. Algorithms 63, No. 2, 512--532 (2023; Zbl 07751063) Full Text: DOI
Breen, Jane; Faught, Nolan; Glover, Cory; Kempton, Mark; Knudson, Adam; Oveson, Alice Kemeny’s constant for nonbacktracking random walks. (English) Zbl 07751058 Random Struct. Algorithms 63, No. 2, 343-363 (2023). MSC: 05C81 05C40 05C50 60C05 PDFBibTeX XMLCite \textit{J. Breen} et al., Random Struct. Algorithms 63, No. 2, 343--363 (2023; Zbl 07751058) Full Text: DOI arXiv
Alon, Yahav; Krivelevich, Michael; Lubetzky, Eyal Cycle lengths in sparse random graphs. (English) Zbl 1522.05075 Random Struct. Algorithms 61, No. 3, 444-461 (2022). MSC: 05C12 05C38 05C80 05C42 PDFBibTeX XMLCite \textit{Y. Alon} et al., Random Struct. Algorithms 61, No. 3, 444--461 (2022; Zbl 1522.05075) Full Text: DOI arXiv
Lichev, Lyuben; Mitsche, Dieter On the modularity of 3-regular random graphs and random graphs with given degree sequences. (English) Zbl 1522.05434 Random Struct. Algorithms 61, No. 4, 754-802 (2022). MSC: 05C80 05C07 05C22 PDFBibTeX XMLCite \textit{L. Lichev} and \textit{D. Mitsche}, Random Struct. Algorithms 61, No. 4, 754--802 (2022; Zbl 1522.05434) Full Text: DOI arXiv
Bhattacharya, Sohom; Dembo, Amir Upper tail for homomorphism counts in constrained sparse random graphs. (English) Zbl 1522.05414 Random Struct. Algorithms 59, No. 3, 315-338 (2021). MSC: 05C80 05C42 05A15 05C60 PDFBibTeX XMLCite \textit{S. Bhattacharya} and \textit{A. Dembo}, Random Struct. Algorithms 59, No. 3, 315--338 (2021; Zbl 1522.05414) Full Text: DOI arXiv
Bates, Erik; Podder, Moumanti Avoidance couplings on non-complete graphs. (English) Zbl 1522.05411 Random Struct. Algorithms 59, No. 1, 25-52 (2021). MSC: 05C80 05C81 PDFBibTeX XMLCite \textit{E. Bates} and \textit{M. Podder}, Random Struct. Algorithms 59, No. 1, 25--52 (2021; Zbl 1522.05411) Full Text: DOI arXiv
Anastos, Michael; Frieze, Alan Finding maximum matchings in random regular graphs in linear expected time. (English) Zbl 1522.05462 Random Struct. Algorithms 58, No. 3, 390-429 (2021). MSC: 05C85 05C70 05C35 05C80 68W40 PDFBibTeX XMLCite \textit{M. Anastos} and \textit{A. Frieze}, Random Struct. Algorithms 58, No. 3, 390--429 (2021; Zbl 1522.05462) Full Text: DOI arXiv
Backhausz, Ágnes; Szegedy, Balázs On large-girth regular graphs and random processes on trees. (English) Zbl 1401.05267 Random Struct. Algorithms 53, No. 3, 389-416 (2018). MSC: 05C80 PDFBibTeX XMLCite \textit{Á. Backhausz} and \textit{B. Szegedy}, Random Struct. Algorithms 53, No. 3, 389--416 (2018; Zbl 1401.05267) Full Text: DOI arXiv Link
Cook, Nicholas A. Discrepancy properties for random regular digraphs. (English) Zbl 1352.05164 Random Struct. Algorithms 50, No. 1, 23-58 (2017). MSC: 05C80 05C20 60K35 60E15 PDFBibTeX XMLCite \textit{N. A. Cook}, Random Struct. Algorithms 50, No. 1, 23--58 (2017; Zbl 1352.05164) Full Text: DOI arXiv Backlinks: MO MO
Fountoulakis, Nikolaos; Panagiotou, Konstantinos Rumor spreading on random regular graphs and expanders. (English) Zbl 1272.05179 Random Struct. Algorithms 43, No. 2, 201-220 (2013). MSC: 05C80 68M14 68R10 68W05 PDFBibTeX XMLCite \textit{N. Fountoulakis} and \textit{K. Panagiotou}, Random Struct. Algorithms 43, No. 2, 201--220 (2013; Zbl 1272.05179) Full Text: DOI arXiv
Letzter, Shoham The property of having a \(k\)-regular subgraph has a sharp threshold. (English) Zbl 1269.05100 Random Struct. Algorithms 42, No. 4, 509-519 (2013). MSC: 05C80 PDFBibTeX XMLCite \textit{S. Letzter}, Random Struct. Algorithms 42, No. 4, 509--519 (2013; Zbl 1269.05100) Full Text: DOI arXiv
Tran, Linh V.; Vu, Van H.; Wang, Ke Sparse random graphs: eigenvalues and eigenvectors. (English) Zbl 1257.05089 Random Struct. Algorithms 42, No. 1, 110-134 (2013). MSC: 05C50 05C80 05C42 PDFBibTeX XMLCite \textit{L. V. Tran} et al., Random Struct. Algorithms 42, No. 1, 110--134 (2013; Zbl 1257.05089) Full Text: DOI arXiv
Shapira, Asaf; Yuster, Raphael The quasi-randomness of hypergraph cut properties. (English) Zbl 1241.05105 Random Struct. Algorithms 40, No. 1, 105-131 (2012). MSC: 05C65 05C80 05E30 PDFBibTeX XMLCite \textit{A. Shapira} and \textit{R. Yuster}, Random Struct. Algorithms 40, No. 1, 105--131 (2012; Zbl 1241.05105) Full Text: DOI arXiv
Krivelevich, Michael; Sudakov, Benny; Wormald, Nicholas Regular induced subgraphs of a random graph. (English) Zbl 1223.05278 Random Struct. Algorithms 38, No. 3, 235-250 (2011). MSC: 05C80 05C35 PDFBibTeX XMLCite \textit{M. Krivelevich} et al., Random Struct. Algorithms 38, No. 3, 235--250 (2011; Zbl 1223.05278) Full Text: DOI arXiv
Nachmias, Asaf; Peres, Yuval Critical percolation on random regular graphs. (English) Zbl 1209.05228 Random Struct. Algorithms 36, No. 2, 111-148 (2010). MSC: 05C80 PDFBibTeX XMLCite \textit{A. Nachmias} and \textit{Y. Peres}, Random Struct. Algorithms 36, No. 2, 111--148 (2010; Zbl 1209.05228) Full Text: DOI arXiv
Fountoulakis, Nikolaos; Kühn, Daniela; Osthus, Deryk Minors in random regular graphs. (English) Zbl 1201.05086 Random Struct. Algorithms 35, No. 4, 444-463 (2009). MSC: 05C83 05C80 PDFBibTeX XMLCite \textit{N. Fountoulakis} et al., Random Struct. Algorithms 35, No. 4, 444--463 (2009; Zbl 1201.05086) Full Text: DOI arXiv
Pluhár, András Greedy colorings of uniform hypergraphs. (English) Zbl 1209.05097 Random Struct. Algorithms 35, No. 2, 216-221 (2009). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{A. Pluhár}, Random Struct. Algorithms 35, No. 2, 216--221 (2009; Zbl 1209.05097) Full Text: DOI
Gao, Zhicheng; Wormald, N. C. Distribution of subgraphs of random regular graphs. (English) Zbl 1131.05084 Random Struct. Algorithms 32, No. 1, 38-48 (2008). MSC: 05C80 60C05 05D40 PDFBibTeX XMLCite \textit{Z. Gao} and \textit{N. C. Wormald}, Random Struct. Algorithms 32, No. 1, 38--48 (2008; Zbl 1131.05084) Full Text: DOI
Alon, Noga; Bachmat, Eitan Regular graphs whose subgraphs tend to be acyclic. (English) Zbl 1114.05092 Random Struct. Algorithms 29, No. 3, 324-337 (2006). Reviewer: David B. Penman (Colchester) MSC: 05C80 PDFBibTeX XMLCite \textit{N. Alon} and \textit{E. Bachmat}, Random Struct. Algorithms 29, No. 3, 324--337 (2006; Zbl 1114.05092) Full Text: DOI
Duckworth, W.; Mans, B. Randomized greedy algorithms for finding small \(k\)-dominating sets of regular graphs. (English) Zbl 1079.05088 Random Struct. Algorithms 27, No. 3, 401-412 (2005). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C69 PDFBibTeX XMLCite \textit{W. Duckworth} and \textit{B. Mans}, Random Struct. Algorithms 27, No. 3, 401--412 (2005; Zbl 1079.05088) Full Text: DOI
Kohayakawa, Y.; Rödl, V. Regular pairs in sparse random graphs. I. (English) Zbl 1022.05076 Random Struct. Algorithms 22, No. 4, 359-434 (2003). Reviewer: David B.Penman (Colchester) MSC: 05C80 05C35 PDFBibTeX XMLCite \textit{Y. Kohayakawa} and \textit{V. Rödl}, Random Struct. Algorithms 22, No. 4, 359--434 (2003; Zbl 1022.05076) Full Text: DOI
Robinson, R. W.; Wormald, N. C. Hamilton cycles containing randomly selected edges in random regular graphs. (English) Zbl 0980.05036 Random Struct. Algorithms 19, No. 2, 128-147 (2001). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C45 05C80 PDFBibTeX XMLCite \textit{R. W. Robinson} and \textit{N. C. Wormald}, Random Struct. Algorithms 19, No. 2, 128--147 (2001; Zbl 0980.05036) Full Text: DOI
Krivelevich, Michael; Sudakov, Benny; Vu, Van H.; Wormald, Nicholas C. Random regular graphs of high degree. (English) Zbl 0996.05106 Random Struct. Algorithms 18, No. 4, 346-363 (2001). Reviewer: Ljuben Mutafchiev (Sofia) MSC: 05C80 60C05 PDFBibTeX XMLCite \textit{M. Krivelevich} et al., Random Struct. Algorithms 18, No. 4, 346--363 (2001; Zbl 0996.05106) Full Text: DOI
Garmo, Hans The asymptotic distribution of long cycles in random regular graphs. (English) Zbl 0935.05081 Random Struct. Algorithms 15, No. 1, 43-92 (1999). Reviewer: Ove Frank (Stockholm) MSC: 05C80 05C38 60F99 05C45 PDFBibTeX XMLCite \textit{H. Garmo}, Random Struct. Algorithms 15, No. 1, 43--92 (1999; Zbl 0935.05081) Full Text: DOI
Molloy, M. S. O.; Robalewska, H.; Robinson, R. W.; Wormald, N. C. 1-factorizations of random regular graphs. (English) Zbl 0974.05062 Random Struct. Algorithms 10, No. 3, 305-321 (1997). MSC: 05C70 05C80 PDFBibTeX XMLCite \textit{M. S. O. Molloy} et al., Random Struct. Algorithms 10, No. 3, 305--321 (1997; Zbl 0974.05062)
Hildebrand, Martin Random walks on random simple graphs. (English) Zbl 0856.60075 Random Struct. Algorithms 8, No. 4, 301-318 (1996). MSC: 60G50 05C80 PDFBibTeX XMLCite \textit{M. Hildebrand}, Random Struct. Algorithms 8, No. 4, 301--318 (1996; Zbl 0856.60075) Full Text: DOI
Fundia, Andrés D. Derandomizing Chebyshev’s inequality to find independent sets in uncrowded hypergraphs. (English) Zbl 0844.05087 Random Struct. Algorithms 8, No. 2, 131-147 (1996). Reviewer: O.Frank (Stockholm) MSC: 05C80 05C65 68R10 60E15 05C85 PDFBibTeX XMLCite \textit{A. D. Fundia}, Random Struct. Algorithms 8, No. 2, 131--147 (1996; Zbl 0844.05087) Full Text: DOI
Molloy, Michael; Reed, Bruce The dominating number of a random cubic graph. (English) Zbl 0839.05085 Random Struct. Algorithms 7, No. 3, 209-221 (1995). Reviewer: G.L.McColm (Tampa) MSC: 05C80 05C35 05C70 60C05 PDFBibTeX XMLCite \textit{M. Molloy} and \textit{B. Reed}, Random Struct. Algorithms 7, No. 3, 209--221 (1995; Zbl 0839.05085) Full Text: DOI
Cooper, Colin On the 2-cyclic property in 2-regular digraphs. (English) Zbl 0842.05056 Random Struct. Algorithms 6, No. 4, 439-448 (1995). Reviewer: C.McDiarmid (Oxford) MSC: 05C38 05C20 60C05 05C80 68R10 PDFBibTeX XMLCite \textit{C. Cooper}, Random Struct. Algorithms 6, No. 4, 439--448 (1995; Zbl 0842.05056) Full Text: DOI
Frieze, Alan; Suen, Stephen On the independence number of random cubic graphs. (English) Zbl 0814.05064 Random Struct. Algorithms 5, No. 5, 649-664 (1994). Reviewer: O.Frank (Stockholm) MSC: 05C80 05C85 68R10 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{S. Suen}, Random Struct. Algorithms 5, No. 5, 649--664 (1994; Zbl 0814.05064) Full Text: DOI
Tyszkiewicz, Jerzy Infinitary queries and their asymptotic probabilities. II: Properties definable in least fixed point logic. (English) Zbl 0828.03011 Random Struct. Algorithms 5, No. 1, 215-234 (1994). Reviewer: N.Curteanu (Iaşi) MSC: 03C13 68Q15 03D15 PDFBibTeX XMLCite \textit{J. Tyszkiewicz}, Random Struct. Algorithms 5, No. 1, 215--234 (1994; Zbl 0828.03011) Full Text: DOI
Kostochka, A. V. On the number of connected subgraphs with small edge-boundary in regular graphs. (English) Zbl 0798.05031 Random Struct. Algorithms 5, No. 1, 147-154 (1994). Reviewer: Liu Yanpei (Beijing) MSC: 05C30 05C35 PDFBibTeX XMLCite \textit{A. V. Kostochka}, Random Struct. Algorithms 5, No. 1, 147--154 (1994; Zbl 0798.05031) Full Text: DOI
Robinson, R. W.; Wormald, N. C. Almost all regular graphs are Hamiltonian. (English) Zbl 0795.05088 Random Struct. Algorithms 5, No. 2, 363-374 (1994). Reviewer: M.Truszczyński (Lexington) MSC: 05C45 05C70 05C38 05C80 05C15 PDFBibTeX XMLCite \textit{R. W. Robinson} and \textit{N. C. Wormald}, Random Struct. Algorithms 5, No. 2, 363--374 (1994; Zbl 0795.05088) Full Text: DOI
Cooper, C. A note on the connectivity of 2-regular digraphs. (English) Zbl 0791.05066 Random Struct. Algorithms 4, No. 4, 469-472 (1993). MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{C. Cooper}, Random Struct. Algorithms 4, No. 4, 469--472 (1993; Zbl 0791.05066) Full Text: DOI
McDiarmid, Colin; Reed, Bruce Linear arboricity of random regular graphs. (English) Zbl 0744.05048 Random Struct. Algorithms 1, No. 4, 443-445 (1990). MSC: 05C80 05C05 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{B. Reed}, Random Struct. Algorithms 1, No. 4, 443--445 (1990; Zbl 0744.05048) Full Text: DOI
Alon, Noga The number of spanning trees in regular graphs. (English) Zbl 0820.05033 Random Struct. Algorithms 1, No. 2, 175-181 (1990). MSC: 05C30 05C05 PDFBibTeX XMLCite \textit{N. Alon}, Random Struct. Algorithms 1, No. 2, 175--181 (1990; Zbl 0820.05033) Full Text: DOI