Aragão, Lucas; Collares, Maurício; Marciano, João Pedro; Martins, Taísa; Morris, Robert A lower bound for set-coloring Ramsey numbers. (English) Zbl 07811287 Random Struct. Algorithms 64, No. 2, 157-169 (2024). MSC: 05C55 05D10 05C15 05D40 05C80 PDFBibTeX XMLCite \textit{L. Aragão} et al., Random Struct. Algorithms 64, No. 2, 157--169 (2024; Zbl 07811287) Full Text: DOI arXiv OA License
Han, Jie; Morris, Patrick; Wang, Guanghui; Yang, Donglei A Ramsey-Turán theory for tilings in graphs. (English) Zbl 07784617 Random Struct. Algorithms 64, No. 1, 94-124 (2024). MSC: 05D10 05B45 05C70 PDFBibTeX XMLCite \textit{J. Han} et al., Random Struct. Algorithms 64, No. 1, 94--124 (2024; Zbl 07784617) Full Text: DOI arXiv
Bradač, Domagoj; Bucić, Matija Covering random graphs with monochromatic trees. (English) Zbl 1525.05153 Random Struct. Algorithms 62, No. 3, 545-563 (2023). Reviewer: Nicolás Sanhueza-Matamala (Praha) MSC: 05C70 05C80 05C65 PDFBibTeX XMLCite \textit{D. Bradač} and \textit{M. Bucić}, Random Struct. Algorithms 62, No. 3, 545--563 (2023; Zbl 1525.05153) Full Text: DOI arXiv OA License
Rödl, Vojtěch; Sales, Marcelo; Zhao, Yi Independence number of hypergraphs under degree conditions. (English) Zbl 1522.05216 Random Struct. Algorithms 63, No. 3, 821-863 (2023). MSC: 05C30 05C65 PDFBibTeX XMLCite \textit{V. Rödl} et al., Random Struct. Algorithms 63, No. 3, 821--863 (2023; Zbl 1522.05216) Full Text: DOI arXiv
Kahn, Jeff; Park, Jinyoung Tuza’s conjecture for random graphs. (English) Zbl 1522.05432 Random Struct. Algorithms 61, No. 2, 235-249 (2022). MSC: 05C80 05C70 PDFBibTeX XMLCite \textit{J. Kahn} and \textit{J. Park}, Random Struct. Algorithms 61, No. 2, 235--249 (2022; Zbl 1522.05432) Full Text: DOI arXiv
Mousset, Frank; Škorić, Nemanja; Trujić, Miloš Covering cycles in sparse graphs. (English) Zbl 1522.05258 Random Struct. Algorithms 60, No. 4, 716-748 (2022). MSC: 05C42 05C38 05C70 PDFBibTeX XMLCite \textit{F. Mousset} et al., Random Struct. Algorithms 60, No. 4, 716--748 (2022; Zbl 1522.05258) Full Text: DOI arXiv
Chang, Yulin; Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Mota, Guilherme Oliveira Factors in randomly perturbed hypergraphs. (English) Zbl 1522.05420 Random Struct. Algorithms 60, No. 2, 153-165 (2022). MSC: 05C80 05C65 PDFBibTeX XMLCite \textit{Y. Chang} et al., Random Struct. Algorithms 60, No. 2, 153--165 (2022; Zbl 1522.05420) Full Text: DOI arXiv
Przykucki, Michał; Roberts, Alexander; Scott, Alex Shotgun reconstruction in the hypercube. (English) Zbl 1522.05139 Random Struct. Algorithms 60, No. 1, 117-150 (2022). MSC: 05C15 05C60 60C05 PDFBibTeX XMLCite \textit{M. Przykucki} et al., Random Struct. Algorithms 60, No. 1, 117--150 (2022; Zbl 1522.05139) Full Text: DOI arXiv OA License
Han, Jie; Morris, Patrick; Treglown, Andrew Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. (English) Zbl 1522.05428 Random Struct. Algorithms 58, No. 3, 480-516 (2021). MSC: 05C80 05B45 PDFBibTeX XMLCite \textit{J. Han} et al., Random Struct. Algorithms 58, No. 3, 480--516 (2021; Zbl 1522.05428) Full Text: DOI arXiv OA License
Fox, Jacob; Li, Ray On edge-ordered Ramsey numbers. (English) Zbl 1454.05076 Random Struct. Algorithms 57, No. 4, 1174-1204 (2020). MSC: 05C55 05D10 05C42 PDFBibTeX XMLCite \textit{J. Fox} and \textit{R. Li}, Random Struct. Algorithms 57, No. 4, 1174--1204 (2020; Zbl 1454.05076) Full Text: DOI arXiv
Ebsen, Oliver; Maesaka, Giulia S.; Reiher, Christian; Schacht, Mathias; Schülke, Bjarne Embedding spanning subgraphs in uniformly dense and inseparable graphs. (English) Zbl 1457.05059 Random Struct. Algorithms 57, No. 4, 1077-1096 (2020). Reviewer: William G. Brown (Montréal) MSC: 05C42 05C45 05C60 05C78 PDFBibTeX XMLCite \textit{O. Ebsen} et al., Random Struct. Algorithms 57, No. 4, 1077--1096 (2020; Zbl 1457.05059) Full Text: DOI arXiv
Ben-Eliezer, Omri; Gishboliner, Lior; Hefetz, Dan; Krivelevich, Michael Very fast construction of bounded-degree spanning graphs via the semi-random graph process. (English) Zbl 1497.68365 Random Struct. Algorithms 57, No. 4, 892-919 (2020). MSC: 68R10 05C80 60C05 PDFBibTeX XMLCite \textit{O. Ben-Eliezer} et al., Random Struct. Algorithms 57, No. 4, 892--919 (2020; Zbl 1497.68365) Full Text: DOI
Glock, Stefan; Joos, Felix A rainbow blow-up lemma. (English) Zbl 1458.05067 Random Struct. Algorithms 56, No. 4, 1031-1069 (2020). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{S. Glock} and \textit{F. Joos}, Random Struct. Algorithms 56, No. 4, 1031--1069 (2020; Zbl 1458.05067) Full Text: DOI arXiv
Kim, Jaehoon; Kim, Younjin; Liu, Hong Tree decompositions of graphs without large bipartite holes. (English) Zbl 1453.05102 Random Struct. Algorithms 57, No. 1, 150-168 (2020). Reviewer: Isabel Beckenbach (Berlin) MSC: 05C70 05C35 05C80 PDFBibTeX XMLCite \textit{J. Kim} et al., Random Struct. Algorithms 57, No. 1, 150--168 (2020; Zbl 1453.05102) Full Text: DOI arXiv
Balogh, József; Molla, Theodore; Sharifzadeh, Maryam Triangle factors of graphs without large independent sets and of weighted graphs. (English) Zbl 1352.05141 Random Struct. Algorithms 49, No. 4, 669-693 (2016). MSC: 05C69 05C12 05C22 05C35 05C70 PDFBibTeX XMLCite \textit{J. Balogh} et al., Random Struct. Algorithms 49, No. 4, 669--693 (2016; Zbl 1352.05141) Full Text: DOI
Böttcher, Julia; Taraz, Anusch; Würfl, Andreas Spanning embeddings of arrangeable graphs with sublinear bandwidth. (English) Zbl 1332.05097 Random Struct. Algorithms 48, No. 2, 270-289 (2016). MSC: 05C60 05C55 05C10 PDFBibTeX XMLCite \textit{J. Böttcher} et al., Random Struct. Algorithms 48, No. 2, 270--289 (2016; Zbl 1332.05097) Full Text: DOI arXiv Link
Kozik, Jakub Multipass greedy coloring of simple uniform hypergraphs. (English) Zbl 1330.05071 Random Struct. Algorithms 48, No. 1, 125-146 (2016). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{J. Kozik}, Random Struct. Algorithms 48, No. 1, 125--146 (2016; Zbl 1330.05071) Full Text: DOI arXiv
Kang, Ross J.; McDiarmid, Colin; Reed, Bruce; Scott, Alex For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set. (English) Zbl 1302.05116 Random Struct. Algorithms 45, No. 3, 343-361 (2014). MSC: 05C55 05A17 05C65 PDFBibTeX XMLCite \textit{R. J. Kang} et al., Random Struct. Algorithms 45, No. 3, 343--361 (2014; Zbl 1302.05116) Full Text: DOI
Rödl, Vojtěch; Schacht, Mathias Complete partite subgraphs in dense hypergraphs. (English) Zbl 1255.05151 Random Struct. Algorithms 41, No. 4, 557-573 (2012). MSC: 05C70 05C65 05C42 05C60 PDFBibTeX XMLCite \textit{V. Rödl} and \textit{M. Schacht}, Random Struct. Algorithms 41, No. 4, 557--573 (2012; Zbl 1255.05151) Full Text: DOI
Shabanov, Dmitry A. Random coloring method in the combinatorial problem of Erdős and Lovász. (English) Zbl 1241.05104 Random Struct. Algorithms 40, No. 2, 227-253 (2012). MSC: 05C65 05C35 05C07 05C15 PDFBibTeX XMLCite \textit{D. A. Shabanov}, Random Struct. Algorithms 40, No. 2, 227--253 (2012; Zbl 1241.05104) Full Text: DOI
Shokoufandeh, Ali; Zhao, Yi Proof of a tiling conjecture of Komlós. (English) Zbl 1029.05121 Random Struct. Algorithms 23, No. 2, 180-205 (2003). Reviewer: Lutz Volkmann (Aachen) MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{A. Shokoufandeh} and \textit{Y. Zhao}, Random Struct. Algorithms 23, No. 2, 180--205 (2003; Zbl 1029.05121) Full Text: DOI