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
Prałat, Paweł; Singh, Harjas Power of \(k\) choices in the semi-random graph process. (English) Zbl 07806446 Electron. J. Comb. 31, No. 1, Research Paper P1.11, 23 p. (2024). Reviewer: Solden Stoll (Seattle) MSC: 05C57 05C80 05C45 91A43 PDFBibTeX XMLCite \textit{P. Prałat} and \textit{H. Singh}, Electron. J. Comb. 31, No. 1, Research Paper P1.11, 23 p. (2024; Zbl 07806446) Full Text: DOI arXiv
Logan, Adam; Molloy, Mike; Prałat, Paweł A variant of the Erdős-Rényi random graph process. (English) Zbl 1522.05437 J. Graph Theory 102, No. 2, 322-345 (2023). MSC: 05C80 60C05 PDFBibTeX XMLCite \textit{A. Logan} et al., J. Graph Theory 102, No. 2, 322--345 (2023; Zbl 1522.05437) Full Text: DOI arXiv
Dereniowski, Dariusz; Gordinowicz, Przemysław; Prałat, Paweł Edge and pair queries-random graphs and complexity. (English) Zbl 1516.05143 Electron. J. Comb. 30, No. 2, Research Paper P2.34, 25 p. (2023). MSC: 05C57 91A43 05C80 05C12 68Q17 PDFBibTeX XMLCite \textit{D. Dereniowski} et al., Electron. J. Comb. 30, No. 2, Research Paper P2.34, 25 p. (2023; Zbl 1516.05143) Full Text: DOI arXiv
Kiwi, Marcos; Lichev, Lyuben; Mitsche, Dieter; Prałat, Paweł Label propagation on binomial random graphs. arXiv:2302.03569 Preprint, arXiv:2302.03569 [math.PR] (2023). MSC: 05C80 60C05 05D40 BibTeX Cite \textit{M. Kiwi} et al., ``Label propagation on binomial random graphs'', Preprint, arXiv:2302.03569 [math.PR] (2023) Full Text: arXiv OA License
Kamiński, Bogumił; Pankratz, Bartosz; Prałat, Paweł; Théberge, François Modularity of the ABCD random graph model with community structure. (English) Zbl 1509.05159 J. Complex Netw. 10, No. 6, Article ID cnac050, 44 p. (2022). MSC: 05C80 05C82 91D99 PDFBibTeX XMLCite \textit{B. Kamiński} et al., J. Complex Netw. 10, No. 6, Article ID cnac050, 44 p. (2022; Zbl 1509.05159) 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
Dudek, Andrzej; English, Sean; Frieze, Alan; MacRury, Calum; Prałat, Paweł Localization game for random graphs. (English) Zbl 1480.05092 Discrete Appl. Math. 309, 202-214 (2022). MSC: 05C57 05C80 05C42 91A43 91A24 PDFBibTeX XMLCite \textit{A. Dudek} et al., Discrete Appl. Math. 309, 202--214 (2022; Zbl 1480.05092) Full Text: DOI arXiv
Georgiou, Konstantinos; Kundu, Somnath; Prałat, Paweł The unit acquisition number of binomial random graphs. (English) Zbl 1470.05145 Electron. J. Comb. 28, No. 3, Research Paper P3.34, 17 p. (2021). MSC: 05C80 05C22 94A05 PDFBibTeX XMLCite \textit{K. Georgiou} et al., Electron. J. Comb. 28, No. 3, Research Paper P3.34, 17 p. (2021; Zbl 1470.05145) Full Text: DOI arXiv
Huq, Reaz; Kamiński, Bogumił; Mashatan, Atefeh; Prałat, Paweł; Szufel, Przemysław On broadcasting time in the model of travelling agents. (English) Zbl 1512.05364 Discrete Appl. Math. 291, 246-263 (2021). MSC: 05C81 05C40 05C82 60J10 60J20 60K35 90B18 PDFBibTeX XMLCite \textit{R. Huq} et al., Discrete Appl. Math. 291, 246--263 (2021; Zbl 1512.05364) Full Text: DOI arXiv
Bal, Deepak; Bennett, Patrick; English, Sean; MacRury, Calum; Prałat, Paweł Zero-forcing in random regular graphs. (English) Zbl 1458.05235 J. Comb. 12, No. 1, 85-116 (2021). MSC: 05C80 05C48 PDFBibTeX XMLCite \textit{D. Bal} et al., J. Comb. 12, No. 1, 85--116 (2021; Zbl 1458.05235) Full Text: DOI arXiv
English, Sean; MacRury, Calum; Prałat, Paweł Probabilistic zero forcing on random graphs. (English) Zbl 1459.05301 Eur. J. Comb. 91, Article ID 103207, 22 p. (2021). Reviewer: Yilun Shang (Newcastle) MSC: 05C80 05C50 05C15 05C69 PDFBibTeX XMLCite \textit{S. English} et al., Eur. J. Comb. 91, Article ID 103207, 22 p. (2021; Zbl 1459.05301) Full Text: DOI arXiv
Frieze, Alan; Pérez-Giménez, Xavier; Prałat, Paweł On the existence of Hamilton cycles with a periodic pattern in a random digraph. (English) Zbl 1453.05120 Electron. J. Comb. 27, No. 4, Research Paper P4.30, 17 p. (2020). MSC: 05C80 05C45 05C20 PDFBibTeX XMLCite \textit{A. Frieze} et al., Electron. J. Comb. 27, No. 4, Research Paper P4.30, 17 p. (2020; Zbl 1453.05120) Full Text: DOI arXiv
Prałat, Paweł; Wormald, Nick Almost all 5-regular graphs have a 3-flow. (English) Zbl 1495.05118 J. Graph Theory 93, No. 2, 147-156 (2020). MSC: 05C21 05C80 PDFBibTeX XMLCite \textit{P. Prałat} and \textit{N. Wormald}, J. Graph Theory 93, No. 2, 147--156 (2020; Zbl 1495.05118) Full Text: DOI arXiv
Mitsche, Dieter; Molloy, Michael; Prałat, Paweł \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph. (English) Zbl 1436.05097 J. Comb. Theory, Ser. B 142, 106-143 (2020). MSC: 05C80 PDFBibTeX XMLCite \textit{D. Mitsche} et al., J. Comb. Theory, Ser. B 142, 106--143 (2020; Zbl 1436.05097) Full Text: DOI arXiv
Prałat, Paweł; Wormald, Nicholas Meyniel’s conjecture holds for random \(d\)-regular graphs. (English) Zbl 1428.05285 Random Struct. Algorithms 55, No. 3, 719-741 (2019). MSC: 05C80 05C57 91A43 91A24 PDFBibTeX XMLCite \textit{P. Prałat} and \textit{N. Wormald}, Random Struct. Algorithms 55, No. 3, 719--741 (2019; Zbl 1428.05285) Full Text: DOI arXiv
Kamiński, Bogumił; Prałat, Paweł Sub-trees of a random tree. (English) Zbl 1419.05047 Discrete Appl. Math. 268, 119-129 (2019). MSC: 05C05 05C80 05C30 PDFBibTeX XMLCite \textit{B. Kamiński} and \textit{P. Prałat}, Discrete Appl. Math. 268, 119--129 (2019; Zbl 1419.05047) Full Text: DOI arXiv
McDiarmid, Colin; Mitsche, Dieter; Prałat, Paweł Clique coloring of binomial random graphs. (English) Zbl 1417.05075 Random Struct. Algorithms 54, No. 4, 589-614 (2019). MSC: 05C15 05C80 05C69 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Random Struct. Algorithms 54, No. 4, 589--614 (2019; Zbl 1417.05075) Full Text: DOI arXiv HAL
Kamiński, Bogumił; Olczak, Tomasz; Prałat, Paweł Parallel execution of schedules with random dependency graph. (English) Zbl 1426.90150 Theor. Comput. Sci. 784, 113-132 (2019). MSC: 90B36 05C80 90C35 90C11 PDFBibTeX XMLCite \textit{B. Kamiński} et al., Theor. Comput. Sci. 784, 113--132 (2019; Zbl 1426.90150) Full Text: DOI
Frieze, Alan; Pérez-Giménez, Xavier; Prałat, Paweł; Reiniger, Benjamin Perfect matchings and Hamiltonian cycles in the preferential attachment model. (English) Zbl 1417.05188 Random Struct. Algorithms 54, No. 2, 258-288 (2019). Reviewer: Serge Lawrencenko (Moskva) MSC: 05C80 05C70 05C45 PDFBibTeX XMLCite \textit{A. Frieze} et al., Random Struct. Algorithms 54, No. 2, 258--288 (2019; Zbl 1417.05188) Full Text: DOI arXiv
Iskhakov, Lenar; Kamiński, Bogumił; Mironov, Maksim; Prałat, Paweł; Prokhorenkova, Liudmila Clustering properties of spatial preferential attachment model. (English) Zbl 1511.05221 Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 15th international workshop, WAW 2018, Moscow, Russia, May 17–18, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10836, 30-43 (2018). MSC: 05C82 05C07 68M10 68Q87 PDFBibTeX XMLCite \textit{L. Iskhakov} et al., Lect. Notes Comput. Sci. 10836, 30--43 (2018; Zbl 1511.05221) Full Text: DOI arXiv
McDiarmid, Colin; Mitsche, Dieter; Prałat, Pawel Clique colourings of geometric graphs. (English) Zbl 1409.05089 Electron. J. Comb. 25, No. 4, Research Paper P4.56, 20 p. (2018). MSC: 05C15 05C35 05C62 05C69 05C80 60D05 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Electron. J. Comb. 25, No. 4, Research Paper P4.56, 20 p. (2018; Zbl 1409.05089) Full Text: arXiv Link
Dudek, Andrzej; Prałat, Paweł Note on the multicolour size-Ramsey number for paths. (English) Zbl 1395.05179 Electron. J. Comb. 25, No. 3, Research Paper P3.35, 5 p. (2018). MSC: 05D10 05C80 PDFBibTeX XMLCite \textit{A. Dudek} and \textit{P. Prałat}, Electron. J. Comb. 25, No. 3, Research Paper P3.35, 5 p. (2018; Zbl 1395.05179) Full Text: arXiv Link
Bonato, Anthony; del Río-Chanona, Rita M.; MacRury, Calum; Nicolaidis, Jake; Pérez-Giménez, Xavier; Prałat, Paweł; Ternovsky, Kirill The robot crawler graph process. (English) Zbl 1394.05114 Discrete Appl. Math. 247, 23-36 (2018). MSC: 05C80 68T20 90C35 90C27 PDFBibTeX XMLCite \textit{A. Bonato} et al., Discrete Appl. Math. 247, 23--36 (2018; Zbl 1394.05114) Full Text: DOI
Dudek, Andrzej; Pérez-Giménez, Xavier; Prałat, Paweł; Qi, Hao; West, Douglas; Zhu, Xuding Randomly twisted hypercubes. (English) Zbl 1384.05140 Eur. J. Comb. 70, 364-373 (2018). MSC: 05C80 05C65 05C38 05C12 PDFBibTeX XMLCite \textit{A. Dudek} et al., Eur. J. Comb. 70, 364--373 (2018; Zbl 1384.05140) Full Text: DOI
Bonato, Anthony; Prałat, Paweł Graph searching games and probabilistic methods. (English) Zbl 1398.91002 Discrete Mathematics and Its Applications. Boca Raton, FL: CRC Press (ISBN 978-1-138-62716-1/hbk; 978-1-032-47641-4/pbk; 978-1-315-21213-5/ebook). xxi, 379 p. (2018). Reviewer: Abbas Mehrabian (Montréal) MSC: 91-02 91A43 91A60 05C80 05C57 91A24 PDFBibTeX XMLCite \textit{A. Bonato} and \textit{P. Prałat}, Graph searching games and probabilistic methods. Boca Raton, FL: CRC Press (2018; Zbl 1398.91002) Full Text: DOI
Ostroumova Prokhorenkova, Liudmila; Prałat, Paweł; Raigorodskii, Andrei Modularity in several random graph models. (English) Zbl 1378.05187 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 947-953 (2017). MSC: 05C80 05C82 PDFBibTeX XMLCite \textit{L. Ostroumova Prokhorenkova} et al., Electron. Notes Discrete Math. 61, 947--953 (2017; Zbl 1378.05187) Full Text: DOI
Bal, Deepak; Bennett, Patrick; Pérez-Giménez, Xavier; Prałat, Paweł Rainbow perfect matchings and Hamilton cycles in the random geometric graph. (English) Zbl 1386.05173 Random Struct. Algorithms 51, No. 4, 587-606 (2017). MSC: 05C80 05C45 05C70 05C15 PDFBibTeX XMLCite \textit{D. Bal} et al., Random Struct. Algorithms 51, No. 4, 587--606 (2017; Zbl 1386.05173) Full Text: DOI arXiv Link
Bonato, Anthony; Pérez-Giménez, Xavier; Prałat, Paweł; Reiniger, Benjamin The game of overprescribed Cops and Robbers played on graphs. (English) Zbl 1371.05179 Graphs Comb. 33, No. 4, 801-815 (2017). MSC: 05C57 91A43 91A24 05C10 PDFBibTeX XMLCite \textit{A. Bonato} et al., Graphs Comb. 33, No. 4, 801--815 (2017; Zbl 1371.05179) Full Text: DOI arXiv
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
Infeld, Ewa; Mitsche, Dieter; Prałat, Paweł The total acquisition number of random geometric graphs. (English) Zbl 1369.05184 Electron. J. Comb. 24, No. 3, Research Paper P3.31, 18 p. (2017). MSC: 05C80 05C10 PDFBibTeX XMLCite \textit{E. Infeld} et al., Electron. J. Comb. 24, No. 3, Research Paper P3.31, 18 p. (2017; Zbl 1369.05184) Full Text: arXiv Link
Mitsche, Dieter; Pérez-Giménez, Xavier; Prałat, Paweł Strong-majority bootstrap percolation on regular graphs with low dissemination threshold. (English) Zbl 1395.60111 Stochastic Processes Appl. 127, No. 9, 3110-3134 (2017). MSC: 60K35 05C80 82B43 PDFBibTeX XMLCite \textit{D. Mitsche} et al., Stochastic Processes Appl. 127, No. 9, 3110--3134 (2017; Zbl 1395.60111) Full Text: DOI arXiv
Mitsche, Dieter; Prałat, Paweł; Roshanbin, Elham Burning graphs: a probabilistic perspective. (English) Zbl 1368.05134 Graphs Comb. 33, No. 2, 449-471 (2017). MSC: 05C80 05C76 60C05 PDFBibTeX XMLCite \textit{D. Mitsche} et al., Graphs Comb. 33, No. 2, 449--471 (2017; Zbl 1368.05134) Full Text: DOI arXiv
Dewar, Megan; Healy, John; Pérez-Giménez, Xavier; Prałat, Paweł; Proos, John; Reiniger, Benjamin; Ternovsky, Kirill Subgraphs in non-uniform random hypergraphs. (English) Zbl 1398.05180 Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 13th international workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-49786-0/pbk; 978-3-319-49787-7/ebook). Lecture Notes in Computer Science 10088, 140-151 (2016). MSC: 05C80 05C65 PDFBibTeX XMLCite \textit{M. Dewar} et al., Lect. Notes Comput. Sci. 10088, 140--151 (2016; Zbl 1398.05180) Full Text: DOI
Bal, Deepak; Bonato, Anthony; Kinnersley, William B.; Prałat, Paweł Lazy cops and robbers played on random graphs and graphs on surfaces. (English) Zbl 1350.05102 J. Comb. 7, No. 4, 627-642 (2016). MSC: 05C57 05C80 91A43 91A24 PDFBibTeX XMLCite \textit{D. Bal} et al., J. Comb. 7, No. 4, 627--642 (2016; Zbl 1350.05102) Full Text: DOI arXiv
Bal, Deepak; Bennett, Patrick; Cooper, Colin; Frieze, Alan; Prałat, Paweł Rainbow arborescence in random digraphs. (English) Zbl 1352.05160 J. Graph Theory 83, No. 3, 251-265 (2016). Reviewer: David B. Penman (Colchester) MSC: 05C80 PDFBibTeX XMLCite \textit{D. Bal} et al., J. Graph Theory 83, No. 3, 251--265 (2016; Zbl 1352.05160) Full Text: DOI arXiv
Dudek, Andrzej; Mitsche, Dieter; Prałat, Paweł The set chromatic number of random graphs. (English) Zbl 1346.05267 Discrete Appl. Math. 215, 61-70 (2016). MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{A. Dudek} et al., Discrete Appl. Math. 215, 61--70 (2016; Zbl 1346.05267) Full Text: DOI arXiv
Bal, Deepak; Bennett, Patrick; Dudek, Andrzej; Prałat, Paweł The total acquisition number of random graphs. (English) Zbl 1339.05366 Electron. J. Comb. 23, No. 2, Research Paper P2.55, 21 p. (2016). MSC: 05C80 05C22 05C05 PDFBibTeX XMLCite \textit{D. Bal} et al., Electron. J. Comb. 23, No. 2, Research Paper P2.55, 21 p. (2016; Zbl 1339.05366) Full Text: arXiv Link
Kinnersley, William B.; Prałat, Paweł Game brush number. (English) Zbl 1337.05078 Discrete Appl. Math. 207, 1-14 (2016). MSC: 05C57 05C80 91A43 PDFBibTeX XMLCite \textit{W. B. Kinnersley} and \textit{P. Prałat}, Discrete Appl. Math. 207, 1--14 (2016; Zbl 1337.05078) Full Text: DOI arXiv
Mitsche, Dieter; Pérez-Giménez, Xavier; Prałat, Paweł The bondage number of random graphs. (English) Zbl 1335.05162 Electron. J. Comb. 23, No. 2, Research Paper P2.13, 27 p. (2016). MSC: 05C80 05C69 PDFBibTeX XMLCite \textit{D. Mitsche} et al., Electron. J. Comb. 23, No. 2, Research Paper P2.13, 27 p. (2016; Zbl 1335.05162) Full Text: arXiv Link
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
Kinnersley, William B.; Prałat, Paweł; West, Douglas B. To catch a falling robber. (English) Zbl 1338.91033 Theor. Comput. Sci. 627, 107-111 (2016). MSC: 91A24 05C57 05C80 05C99 91A43 PDFBibTeX XMLCite \textit{W. B. Kinnersley} et al., Theor. Comput. Sci. 627, 107--111 (2016; Zbl 1338.91033) Full Text: DOI arXiv
Prałat, Paweł; Wormald, Nicholas Meyniel’s conjecture holds for random graphs. (English) Zbl 1332.05096 Random Struct. Algorithms 48, No. 2, 396-421 (2016). MSC: 05C57 05C80 91A43 91A24 PDFBibTeX XMLCite \textit{P. Prałat} and \textit{N. Wormald}, Random Struct. Algorithms 48, No. 2, 396--421 (2016; Zbl 1332.05096) Full Text: DOI arXiv
Bonato, Anthony; Lozier, Marc; Mitsche, Dieter; Pérez-Giménez, Xavier; Prałat, Paweł The domination number of on-line social networks and random geometric graphs. (English) Zbl 1462.05271 Jain, Rahul (ed.) et al., Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9076, 150-163 (2015). MSC: 05C69 05C82 05C80 91D30 PDFBibTeX XMLCite \textit{A. Bonato} et al., Lect. Notes Comput. Sci. 9076, 150--163 (2015; Zbl 1462.05271) Full Text: DOI arXiv
Li, Anshui; Müller, Tobias; Prałat, Paweł Chasing robbers on percolated random geometric graphs. (English) Zbl 1329.05265 Contrib. Discrete Math. 10, No. 1, 134-144 (2015). MSC: 05C80 05C57 68R10 91A43 PDFBibTeX XMLCite \textit{A. Li} et al., Contrib. Discrete Math. 10, No. 1, 134--144 (2015; Zbl 1329.05265)
Frieze, Alan; Mitsche, Dieter; Pérez-Giménez, Xavier; Prałat, Paweł On-line list colouring of random graphs. (English) Zbl 1327.05109 Electron. J. Comb. 22, No. 2, Research Paper P2.41, 17 p. (2015). MSC: 05C15 05C80 PDFBibTeX XMLCite \textit{A. Frieze} et al., Electron. J. Comb. 22, No. 2, Research Paper P2.41, 17 p. (2015; Zbl 1327.05109) Full Text: arXiv Link
Müller, Tobias; Prałat, Paweł The acquaintance time of (percolated) random geometric graphs. (English) Zbl 1315.05126 Eur. J. Comb. 48, 198-214 (2015). MSC: 05C80 PDFBibTeX XMLCite \textit{T. Müller} and \textit{P. Prałat}, Eur. J. Comb. 48, 198--214 (2015; Zbl 1315.05126) Full Text: DOI arXiv
Prałat, Paweł Containment game played on random graphs: another zig-zag theorem. (English) Zbl 1328.05122 Electron. J. Comb. 22, No. 2, Research Paper P2.32, 14 p. (2015). MSC: 05C57 05C80 PDFBibTeX XMLCite \textit{P. Prałat}, Electron. J. Comb. 22, No. 2, Research Paper P2.32, 14 p. (2015; Zbl 1328.05122) Full Text: arXiv Link
Bal, Deepak; Bennett, Patrick; Frieze, Alan; Prałat, Paweł Power of \(k\) choices and rainbow spanning trees in random graphs. (English) Zbl 1307.05064 Electron. J. Comb. 22, No. 1, Research Paper P1.29, 22 p. (2015). MSC: 05C15 05C35 05C05 05C80 PDFBibTeX XMLCite \textit{D. Bal} et al., Electron. J. Comb. 22, No. 1, Research Paper P1.29, 22 p. (2015; Zbl 1307.05064) Full Text: arXiv Link
Prałat, Paweł Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\). (English) Zbl 1302.05172 Discrete Math. 338, No. 1, 47-52 (2015). MSC: 05C80 05C57 05C69 PDFBibTeX XMLCite \textit{P. Prałat}, Discrete Math. 338, No. 1, 47--52 (2015; Zbl 1302.05172) Full Text: DOI arXiv
Cooper, Colin; Frieze, Alan; Prałat, Paweł Some typical properties of the spatial preferred attachment model. (English) Zbl 1461.05196 Internet Math. 10, No. 1-2, 116-136 (2014). MSC: 05C82 05C80 68M11 68R10 90B15 PDFBibTeX XMLCite \textit{C. Cooper} et al., Internet Math. 10, No. 1--2, 116--136 (2014; Zbl 1461.05196) Full Text: DOI
Bonato, Anthony; Kinnersley, William B.; Prałat, Paweł Toppling numbers of complete and random graphs. (English) Zbl 1306.05154 Discrete Math. Theor. Comput. Sci. 16, No. 3, 229-252 (2014). MSC: 05C57 05C80 91A43 91A05 PDFBibTeX XMLCite \textit{A. Bonato} et al., Discrete Math. Theor. Comput. Sci. 16, No. 3, 229--252 (2014; Zbl 1306.05154) Full Text: arXiv Link
Prałat, Paweł Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly. (English) Zbl 1298.05225 Graphs Comb. 30, No. 2, 455-470 (2014). MSC: 05C57 05C80 PDFBibTeX XMLCite \textit{P. Prałat}, Graphs Comb. 30, No. 2, 455--470 (2014; Zbl 1298.05225) Full Text: DOI
Alon, Noga; Prałat, Paweł Chasing robbers on random geometric graphs-an alternative approach. (English) Zbl 1300.05176 Discrete Appl. Math. 178, 149-152 (2014). MSC: 05C57 05C80 91A43 91A24 PDFBibTeX XMLCite \textit{N. Alon} and \textit{P. Prałat}, Discrete Appl. Math. 178, 149--152 (2014; Zbl 1300.05176) Full Text: DOI arXiv
Mitsche, Dieter; Prałat, Paweł On the hyperbolicity of random graphs. (English) Zbl 1300.05286 Electron. J. Comb. 21, No. 2, Research Paper P2.39, 24 p. (2014). MSC: 05C80 05C40 05C12 05C35 PDFBibTeX XMLCite \textit{D. Mitsche} and \textit{P. Prałat}, Electron. J. Comb. 21, No. 2, Research Paper P2.39, 24 p. (2014; Zbl 1300.05286) Full Text: arXiv Link
Janssen, Jeannette; Prałat, Paweł; Wilson, Rory Asymmetric distribution of nodes in the spatial preferred attachment model. (English) Zbl 1342.05142 Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 10th international workshop, WAW 2013, Cambridge, MA, USA, December 14–15, 2013. Proceedings. Berlin: Springer (ISBN 978-3-319-03535-2/pbk). Lecture Notes in Computer Science 8305, 1-13 (2013). MSC: 05C80 05C82 05C12 05C42 68M10 68R10 PDFBibTeX XMLCite \textit{J. Janssen} et al., Lect. Notes Comput. Sci. 8305, 1--13 (2013; Zbl 1342.05142) Full Text: DOI
Bollobás, Béla; Mitsche, Dieter; Prałat, Paweł Metric dimension for random graphs. (English) Zbl 1295.05095 Electron. J. Comb. 20, No. 4, Research Paper P1, 19 p. (2013). MSC: 05C12 05C80 68R10 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Electron. J. Comb. 20, No. 4, Research Paper P1, 19 p. (2013; Zbl 1295.05095) Full Text: arXiv Link
Kinnersley, William B.; Mitsche, Dieter; Prałat, Paweł A note on the acquaintance time of random graphs. (English) Zbl 1295.05210 Electron. J. Comb. 20, No. 3, Research Paper P52, 8 p. (2013). MSC: 05C80 05C57 68R10 PDFBibTeX XMLCite \textit{W. B. Kinnersley} et al., Electron. J. Comb. 20, No. 3, Research Paper P52, 8 p. (2013; Zbl 1295.05210) Full Text: arXiv Link
Prałat, Paweł Sparse graphs are not flammable. (English) Zbl 1285.05124 SIAM J. Discrete Math. 27, No. 4, 2157-2166 (2013). MSC: 05C57 05C42 05C80 PDFBibTeX XMLCite \textit{P. Prałat}, SIAM J. Discrete Math. 27, No. 4, 2157--2166 (2013; Zbl 1285.05124) Full Text: DOI arXiv
Kehagias, Athanasios; Mitsche, Dieter; Prałat, Paweł Cops and invisible robbers: the cost of drunkenness. (English) Zbl 1291.91039 Theor. Comput. Sci. 481, 100-120 (2013). MSC: 91A43 05C57 05C81 05C85 PDFBibTeX XMLCite \textit{A. Kehagias} et al., Theor. Comput. Sci. 481, 100--120 (2013; Zbl 1291.91039) Full Text: DOI arXiv
Bonato, Anthony; Mitsche, Dieter; Prałat, Paweł Vertex-pursuit in random directed acyclic graphs. (English) Zbl 1272.05178 SIAM J. Discrete Math. 27, No. 2, 732-756 (2013). MSC: 05C80 05C57 94C15 PDFBibTeX XMLCite \textit{A. Bonato} et al., SIAM J. Discrete Math. 27, No. 2, 732--756 (2013; Zbl 1272.05178) Full Text: DOI arXiv
Bonato, Anthony; Gordinowicz, Przemysław; Kinnersley, Bill; Prałat, Paweł The capture time of the hypercube. (English) Zbl 1266.05096 Electron. J. Comb. 20, No. 2, Research Paper P24, 12 p. (2013). MSC: 05C57 05C65 91A24 05C80 PDFBibTeX XMLCite \textit{A. Bonato} et al., Electron. J. Comb. 20, No. 2, Research Paper P24, 12 p. (2013; Zbl 1266.05096) Full Text: arXiv Link
Mitsche, Dieter; Prałat, Paweł Revolutionaries and spies on random graphs. (English) Zbl 1263.05098 Comb. Probab. Comput. 22, No. 3, 417-432 (2013). MSC: 05C80 05C57 68R10 91A24 05C42 PDFBibTeX XMLCite \textit{D. Mitsche} and \textit{P. Prałat}, Comb. Probab. Comput. 22, No. 3, 417--432 (2013; Zbl 1263.05098) Full Text: DOI arXiv
Janssen, Jeannette; Prałat, Paweł; Wilson, Rory Geometric graph properties of the spatial preferred attachment model. (English) Zbl 1255.90027 Adv. Appl. Math. 50, No. 2, 243-267 (2013). MSC: 90B15 68R10 05C80 PDFBibTeX XMLCite \textit{J. Janssen} et al., Adv. Appl. Math. 50, No. 2, 243--267 (2013; Zbl 1255.90027) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Prałat, Paweł Cops and robber with constraints. (English) Zbl 1248.05120 SIAM J. Discrete Math. 26, No. 2, 571-590 (2012). MSC: 05C57 05C80 05C85 68R10 91A24 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 26, No. 2, 571--590 (2012; Zbl 1248.05120) Full Text: DOI
Cooper, Colin; Frieze, Alan; Prałat, Paweł Some typical properties of the spatial preferred attachment model. (English) Zbl 1342.05160 Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 9th international workshop, WAW 2012, Halifax, NS, Canada, June 22–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30540-5/pbk). Lecture Notes in Computer Science 7323, 29-40 (2012). MSC: 05C82 05C80 90B15 68R10 PDFBibTeX XMLCite \textit{C. Cooper} et al., Lect. Notes Comput. Sci. 7323, 29--40 (2012; Zbl 1342.05160) Full Text: DOI
Bonato, A.; Mitsche, D.; Prałat, P. Vertex-pursuit in hierarchical social networks. (English) Zbl 1354.91120 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 50-60 (2012). MSC: 91D30 05C80 91A43 PDFBibTeX XMLCite \textit{A. Bonato} et al., Lect. Notes Comput. Sci. 7287, 50--60 (2012; Zbl 1354.91120) Full Text: DOI
Bonato, Anthony; Messinger, Margaret-Ellen; Prałat, Paweł Fighting constrained fires in graphs. (English) Zbl 1244.05196 Theor. Comput. Sci. 434, 11-22 (2012). MSC: 05C80 05C90 PDFBibTeX XMLCite \textit{A. Bonato} et al., Theor. Comput. Sci. 434, 11--22 (2012; Zbl 1244.05196) Full Text: DOI
Bonato, Anthony; Kemkes, Graeme; Prałat, Paweł Almost all cop-win graphs contain a universal vertex. (English) Zbl 1242.05178 Discrete Math. 312, No. 10, 1652-1657 (2012). MSC: 05C57 05C80 PDFBibTeX XMLCite \textit{A. Bonato} et al., Discrete Math. 312, No. 10, 1652--1657 (2012; Zbl 1242.05178) Full Text: DOI
Bonato, Anthony; Brown, Jason I.; Kemkes, Graeme; Prałat, Paweł Independence and chromatic densities of graphs. (English) Zbl 1252.05102 J. Comb. 2, No. 3, 397-412 (2011). MSC: 05C42 05C63 05C30 05C80 05C15 PDFBibTeX XMLCite \textit{A. Bonato} et al., J. Comb. 2, No. 3, 397--412 (2011; Zbl 1252.05102) Full Text: DOI
Prałat, Paweł; Verstraëte, Jacques; Wormald, Nicholas On the threshold for \(k\)-regular subgraphs of random graphs. (English) Zbl 1263.05099 Combinatorica 31, No. 5, 565-581 (2011). Reviewer: Ko-Wei Lih (Taipei City) MSC: 05C80 05C70 05D40 PDFBibTeX XMLCite \textit{P. Prałat} et al., Combinatorica 31, No. 5, 565--581 (2011; Zbl 1263.05099) Full Text: DOI arXiv
Prałat, Paweł Cleaning random \(d\)-regular graphs with brooms. (English) Zbl 1235.05126 Graphs Comb. 27, No. 4, 567-584 (2011). MSC: 05C80 PDFBibTeX XMLCite \textit{P. Prałat}, Graphs Comb. 27, No. 4, 567--584 (2011; Zbl 1235.05126) Full Text: DOI
Prałat, Paweł; Wang, Changping An edge deletion model for complex networks. (English) Zbl 1226.68072 Theor. Comput. Sci. 412, No. 39, 5111-5120 (2011). MSC: 68R10 68M10 05C80 PDFBibTeX XMLCite \textit{P. Prałat} and \textit{C. Wang}, Theor. Comput. Sci. 412, No. 39, 5111--5120 (2011; Zbl 1226.68072) Full Text: DOI
Cooper, Colin; Prałat, Paweł Scale-free graphs of increasing degree. (English) Zbl 1223.05274 Random Struct. Algorithms 38, No. 4, 396-421 (2011). MSC: 05C80 05C07 68M11 PDFBibTeX XMLCite \textit{C. Cooper} and \textit{P. Prałat}, Random Struct. Algorithms 38, No. 4, 396--421 (2011; Zbl 1223.05274) Full Text: DOI
Prałat, Paweł Connectivity threshold and recovery time in rank-based models for complex networks. (English) Zbl 1223.05281 Discrete Math. 311, No. 12, 932-939 (2011). MSC: 05C80 68M10 PDFBibTeX XMLCite \textit{P. Prałat}, Discrete Math. 311, No. 12, 932--939 (2011; Zbl 1223.05281) Full Text: DOI
Alon, Noga; Prałat, Paweł Modular orientations of random and quasi-random regular graphs. (English) Zbl 1226.05222 Comb. Probab. Comput. 20, No. 3, 321-329 (2011). MSC: 05C80 05C20 PDFBibTeX XMLCite \textit{N. Alon} and \textit{P. Prałat}, Comb. Probab. Comput. 20, No. 3, 321--329 (2011; Zbl 1226.05222) Full Text: DOI
Benjamini, Itai; Hoppen, Carlos; Ofek, Eran; Prałat, Paweł; Wormald, Nick Geodesics and almost geodesic cycles in random regular graphs. (English) Zbl 1218.05074 J. Graph Theory 66, No. 2, 115-136 (2011). Reviewer: Lai Chunhui (Zhangzhou) MSC: 05C38 05C80 PDFBibTeX XMLCite \textit{I. Benjamini} et al., J. Graph Theory 66, No. 2, 115--136 (2011; Zbl 1218.05074) Full Text: DOI arXiv
Bonato, Anthony; Gordinowicz, Przemysław; Prałat, Paweł Bounds and constructions for \(n\)-e.c. tournaments. (English) Zbl 1317.05160 Contrib. Discrete Math. 5, No. 2, 52-66, (2010). MSC: 05C75 05C85 05C80 PDFBibTeX XMLCite \textit{A. Bonato} et al., Contrib. Discrete Math. 5, No. 2, 52--66, (2010; Zbl 1317.05160) Full Text: Link
Gordinowicz, Przemysław; Prałat, Paweł The search for the smallest 3-E.C. graphs. (English) Zbl 1225.05218 J. Comb. Math. Comb. Comput. 74, 129-142 (2010). MSC: 05C80 05C75 PDFBibTeX XMLCite \textit{P. Gordinowicz} and \textit{P. Prałat}, J. Comb. Math. Comb. Comput. 74, 129--142 (2010; Zbl 1225.05218)
Janssen, Jeannette; Prałat, Paweł Rank-based attachment leads to power law graphs. (English) Zbl 1213.05237 SIAM J. Discrete Math. 24, No. 2, 420-440 (2010). MSC: 05C80 05C07 PDFBibTeX XMLCite \textit{J. Janssen} and \textit{P. Prałat}, SIAM J. Discrete Math. 24, No. 2, 420--440 (2010; Zbl 1213.05237) Full Text: DOI arXiv
Łuczak, Tomasz; Prałat, Paweł Chasing robbers on random graphs: zigzag theorem. (English) Zbl 1209.05226 Random Struct. Algorithms 37, No. 4, 516-524 (2010). MSC: 05C80 91A43 PDFBibTeX XMLCite \textit{T. Łuczak} and \textit{P. Prałat}, Random Struct. Algorithms 37, No. 4, 516--524 (2010; Zbl 1209.05226) Full Text: DOI
Bonato, Anthony; Chiniforooshan, Ehsan; Prałat, Paweł Cops and robbers from a distance. (English) Zbl 1200.91042 Theor. Comput. Sci. 411, No. 43, 3834-3844 (2010). MSC: 91A24 91A43 05C80 05C57 68Q25 PDFBibTeX XMLCite \textit{A. Bonato} et al., Theor. Comput. Sci. 411, No. 43, 3834--3844 (2010; Zbl 1200.91042) Full Text: DOI
Prałat, Paweł When does a random graph have constant cop number? (English) Zbl 1196.05089 Australas. J. Comb. 46, 285-296 (2010). MSC: 05C80 05C57 91A43 PDFBibTeX XMLCite \textit{P. Prałat}, Australas. J. Comb. 46, 285--296 (2010; Zbl 1196.05089)
Baker, Catharine A.; Bonato, Anthony; McKay, Neil A.; Prałat, Paweł Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs. (English) Zbl 1227.05226 J. Comb. Des. 17, No. 4, 294-306 (2009). MSC: 05C80 05B05 PDFBibTeX XMLCite \textit{C. A. Baker} et al., J. Comb. Des. 17, No. 4, 294--306 (2009; Zbl 1227.05226) Full Text: DOI
Bonato, Anthony; Prałat, Paweł The good, the bad, and the great: homomorphisms and cores of random graphs. (English) Zbl 1215.05158 Discrete Math. 309, No. 18, 5535-5539 (2009). MSC: 05C80 PDFBibTeX XMLCite \textit{A. Bonato} and \textit{P. Prałat}, Discrete Math. 309, No. 18, 5535--5539 (2009; Zbl 1215.05158) Full Text: DOI
Janssen, Jeannette; Prałat, Paweł Protean graphs with a variety of ranking schemes. (English) Zbl 1192.68485 Theor. Comput. Sci. 410, No. 52, 5491-5504 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Janssen} and \textit{P. Prałat}, Theor. Comput. Sci. 410, No. 52, 5491--5504 (2009; Zbl 1192.68485) Full Text: DOI
Prałat, Paweł Cleaning random graphs with brushes. (English) Zbl 1155.05336 Australas. J. Comb. 43, 237-251 (2009). MSC: 05C80 PDFBibTeX XMLCite \textit{P. Prałat}, Australas. J. Comb. 43, 237--251 (2009; Zbl 1155.05336)
Aiello, W.; Bonato, A.; Cooper, C.; Janssen, J.; Prałat, P. A spatial web graph model with local influence regions. (English) Zbl 1206.68221 Internet Math. 5, No. 1-2, 175-193 (2008). MSC: 68Q87 68M10 68R10 PDFBibTeX XMLCite \textit{W. Aiello} et al., Internet Math. 5, No. 1--2, 175--193 (2008; Zbl 1206.68221) Full Text: DOI Euclid
Alon, Noga; Praat, Paweł; Wormald, Nicholas Cleaning regular graphs with brushes. (English) Zbl 1187.05066 SIAM J. Discrete Math. 23, No. 1, 233-250 (2008). Reviewer: David B. Penman (Colchester) MSC: 05C80 PDFBibTeX XMLCite \textit{N. Alon} et al., SIAM J. Discrete Math. 23, No. 1, 233--250 (2008; Zbl 1187.05066) Full Text: DOI
Prałat, Paweł The diameter of protean graphs. (English) Zbl 1153.05064 Discrete Math. 308, No. 15, 3399-3406 (2008). Reviewer: Ove Frank (Stockholm) MSC: 05C80 68R10 94C15 PDFBibTeX XMLCite \textit{P. Prałat}, Discrete Math. 308, No. 15, 3399--3406 (2008; Zbl 1153.05064) Full Text: DOI
Prałat, Paweł; Wormald, Nicholas Growing protean graphs. (English) Zbl 1167.05047 Internet Math. 4, No. 1, 1-16 (2007). MSC: 05C80 68R10 05C07 34F05 68M10 05C40 PDFBibTeX XMLCite \textit{P. Prałat} and \textit{N. Wormald}, Internet Math. 4, No. 1, 1--16 (2007; Zbl 1167.05047) Full Text: DOI
Bonato, Anthony; Prałat, Paweł; Wang, Changping Vertex pursuit games in stochastic network models. (English) Zbl 1136.90319 Janssen, Jeannette (ed.) et al., Combinatorial and algorithmic aspects of networking. 4th workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77293-4/pbk). Lecture Notes in Computer Science 4852, 46-56 (2007). MSC: 90B15 05C80 91A24 PDFBibTeX XMLCite \textit{A. Bonato} et al., Lect. Notes Comput. Sci. 4852, 46--56 (2007; Zbl 1136.90319) Full Text: DOI
Messinger, Margaret-Ellen; Prałat, Paweł; Nowakowski, Richard J.; Wormald, Nicholas Cleaning random \(d\)-regular graphs with brushes using a degree-greedy algorithm. (English) Zbl 1136.05320 Janssen, Jeannette (ed.) et al., Combinatorial and algorithmic aspects of networking. 4th workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77293-4/pbk). Lecture Notes in Computer Science 4852, 13-26 (2007). MSC: 05C80 05C90 PDFBibTeX XMLCite \textit{M.-E. Messinger} et al., Lect. Notes Comput. Sci. 4852, 13--26 (2007; Zbl 1136.05320) Full Text: DOI
Łuczak, Tomasz; Prałat, Paweł Protean graphs. (English) Zbl 1114.68053 Internet Math. 3, No. 1, 21-40 (2006). MSC: 68R10 68M10 05C80 PDFBibTeX XMLCite \textit{T. Łuczak} and \textit{P. Prałat}, Internet Math. 3, No. 1, 21--40 (2006; Zbl 1114.68053) Full Text: DOI