Bal, Deepak; Frieze, Alan; Prałat, Paweł Rainbow spanning trees in randomly colored \(G_{k-out}\). (English) Zbl 07818429 SIAM J. Discrete Math. 38, No. 1, 867-882 (2024). MSC: 05C15 05C05 05C80 PDFBibTeX XMLCite \textit{D. Bal} et al., SIAM J. Discrete Math. 38, No. 1, 867--882 (2024; Zbl 07818429) Full Text: DOI arXiv
Ganian, Robert; Kim, Eun Jung; Szeider, Stefan Algorithmic applications of tree-cut width. (English) Zbl 1503.05117 SIAM J. Discrete Math. 36, No. 4, 2635-2666 (2022). MSC: 05C85 68Q25 90C05 90C10 PDFBibTeX XMLCite \textit{R. Ganian} et al., SIAM J. Discrete Math. 36, No. 4, 2635--2666 (2022; Zbl 1503.05117) Full Text: DOI arXiv
Gao, Pu; MacRury, Calum; Prałat, Paweł Perfect matchings in the semirandom graph process. (English) Zbl 1490.05247 SIAM J. Discrete Math. 36, No. 2, 1274-1290 (2022). MSC: 05C80 05C70 05C57 PDFBibTeX XMLCite \textit{P. Gao} et al., SIAM J. Discrete Math. 36, No. 2, 1274--1290 (2022; Zbl 1490.05247) Full Text: DOI arXiv
Moreira, Luiz Ramsey goodness of clique versus paths in random graphs. (English) Zbl 1475.05116 SIAM J. Discrete Math. 35, No. 3, 2210-2222 (2021). MSC: 05C55 05D10 05D40 05C80 PDFBibTeX XMLCite \textit{L. Moreira}, SIAM J. Discrete Math. 35, No. 3, 2210--2222 (2021; Zbl 1475.05116) Full Text: DOI arXiv
Kamcev, Nina; Liebenau, Anita; Wood, David R.; Yepremyan, Liana The size Ramsey number of graphs with bounded treewidth. (English) Zbl 1459.05201 SIAM J. Discrete Math. 35, No. 1, 281-293 (2021). MSC: 05C55 05D10 05C05 05C42 PDFBibTeX XMLCite \textit{N. Kamcev} et al., SIAM J. Discrete Math. 35, No. 1, 281--293 (2021; Zbl 1459.05201) Full Text: DOI arXiv
Hoppen, Carlos; Parente, Roberto F.; Sato, Cristiane M. Packing arborescences in random digraphs. (English) Zbl 1406.05094 SIAM J. Discrete Math. 33, No. 1, 438-453 (2019). MSC: 05C80 05C20 05D40 05C05 05C35 PDFBibTeX XMLCite \textit{C. Hoppen} et al., SIAM J. Discrete Math. 33, No. 1, 438--453 (2019; Zbl 1406.05094) Full Text: DOI
Lu, Linyuan; Wang, Zhiyu On the size-Ramsey number of tight paths. (English) Zbl 1395.05181 SIAM J. Discrete Math. 32, No. 3, 2172-2179 (2018). MSC: 05D10 05C55 PDFBibTeX XMLCite \textit{L. Lu} and \textit{Z. Wang}, SIAM J. Discrete Math. 32, No. 3, 2172--2179 (2018; Zbl 1395.05181) Full Text: DOI arXiv
Li, Jiaao; Hou, Xinmin; Han, Miaomiao; Lai, Hong-Jian Mod \((2p+1)\)-orientation on bipartite graphs and complementary graphs. (English) Zbl 1377.05066 SIAM J. Discrete Math. 32, No. 1, 29-43 (2018). MSC: 05C15 05C21 05C40 PDFBibTeX XMLCite \textit{J. Li} et al., SIAM J. Discrete Math. 32, No. 1, 29--43 (2018; Zbl 1377.05066) Full Text: DOI
Janssen, Jeannette; Mehrabian, Abbas Rumors spread slowly in a small-world spatial network. (English) Zbl 1373.05185 SIAM J. Discrete Math. 31, No. 4, 2414-2428 (2017). MSC: 05C82 05C80 60D05 90B15 91D30 PDFBibTeX XMLCite \textit{J. Janssen} and \textit{A. Mehrabian}, SIAM J. Discrete Math. 31, No. 4, 2414--2428 (2017; Zbl 1373.05185) Full Text: DOI
Dudek, Andrzej; Prałat, Paweł On some multicolor Ramsey properties of random graphs. (English) Zbl 1370.05211 SIAM J. Discrete Math. 31, No. 3, 2079-2092 (2017). MSC: 05D10 05C55 05C80 05C15 PDFBibTeX XMLCite \textit{A. Dudek} and \textit{P. Prałat}, SIAM J. Discrete Math. 31, No. 3, 2079--2092 (2017; Zbl 1370.05211) Full Text: DOI arXiv
Bujtás, Csilla; Henning, Michael A.; Tuza, Zsolt Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game. (English) Zbl 1345.05061 SIAM J. Discrete Math. 30, No. 3, 1830-1847 (2016). MSC: 05C57 05C65 05C69 91A43 PDFBibTeX XMLCite \textit{C. Bujtás} et al., SIAM J. Discrete Math. 30, No. 3, 1830--1847 (2016; Zbl 1345.05061) Full Text: DOI
Dudek, Andrzej; Prałat, Paweł Acquaintance time of random graphs near connectivity threshold. (English) Zbl 1333.05271 SIAM J. Discrete Math. 30, No. 1, 555-568 (2016). MSC: 05C80 05C40 05C57 05C65 91A43 68R10 PDFBibTeX XMLCite \textit{A. Dudek} and \textit{P. Prałat}, SIAM J. Discrete Math. 30, No. 1, 555--568 (2016; Zbl 1333.05271) Full Text: DOI arXiv
Henning, Michael A.; Kinnersley, William B. Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two. (English) Zbl 1329.05210 SIAM J. Discrete Math. 30, No. 1, 20-35 (2016). MSC: 05C57 05C69 05C07 05C35 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{W. B. Kinnersley}, SIAM J. Discrete Math. 30, No. 1, 20--35 (2016; Zbl 1329.05210) Full Text: DOI Link