☰

Andrzej Dudek, Ph.D. - Publications

Affiliations: 
2008 Emory University, Atlanta, GA 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

59 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Bennett P, Dudek A, Zerbib S. Large triangle packings and Tuza’s conjecture in sparse random graphs Combinatorics, Probability & Computing. 29: 757-779. DOI: 10.1017/S0963548320000115  0.493
2020 Bennett P, Dudek A, Lidický B, Pikhurko O. Minimizing the number of 5-cycles in graphs with given edge-density Combinatorics, Probability & Computing. 29: 44-67. DOI: 10.1017/S0963548319000257  0.542
2020 Balogh J, Dudek A, Li L. An analogue of the Erdős–Gallai theorem for random graphs European Journal of Combinatorics. 103200. DOI: 10.1016/J.Ejc.2020.103200  0.527
2020 Dudek A, Reiher C, Ruciński A, Schacht M. Powers of Hamiltonian cycles in randomly augmented graphs Random Structures and Algorithms. 56: 122-141. DOI: 10.1002/Rsa.20870  0.692
2019 Bennett P, DeBiasio L, Dudek A, English S. Large monochromatic components and long monochromatic cycles in random hypergraphs European Journal of Combinatorics. 76: 123-137. DOI: 10.1016/J.Ejc.2018.10.001  0.419
2019 Dudek A, Frieze AM, Pegden W. A note on the localization number of random graphs: diameter two case Discrete Applied Mathematics. 254: 107-112. DOI: 10.1016/J.Dam.2018.06.006  0.484
2018 Dudek A, Prałat P. Note on the Multicolour Size-Ramsey Number for Paths, Electronic Journal of Combinatorics. 25: 3-35. DOI: 10.37236/7954  0.435
2018 Dudek A, English S, Frieze AM. On Rainbow Hamilton Cycles in Random Hypergraphs Electronic Journal of Combinatorics. 25: 2-55. DOI: 10.37236/7274  0.516
2018 Dudek A, Pérez-Giménez X, Pralat P, Qi H, West DB, Zhu X. Randomly twisted hypercubes European Journal of Combinatorics. 70: 364-373. DOI: 10.1016/J.Ejc.2018.01.013  0.442
2018 Dudek A, Khoeini F, Prałat P. Size-Ramsey numbers of cycles versus a path Discrete Mathematics. 341: 2095-2103. DOI: 10.1016/J.Disc.2018.04.008  0.525
2017 Dudek A, Prałat P. On some Multicolor Ramsey Properties of Random Graphs Siam Journal On Discrete Mathematics. 31: 2079-2092. DOI: 10.1137/16M1069717  0.552
2017 Dudek A, Frieze AM, Rucinski A, Sileikis M. Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity Journal of Combinatorial Theory, Series B. 122: 719-740. DOI: 10.1016/J.Jctb.2016.09.003  0.512
2017 Bennett P, Dudek A. On the Ramsey–Turán number with small s-independence number Journal of Combinatorial Theory, Series B. 122: 690-718. DOI: 10.1016/J.Jctb.2016.09.002  0.524
2017 Dudek A, Helenius L. On offset Hamilton cycles in random hypergraphs Discrete Applied Mathematics. 238: 77-85. DOI: 10.1016/J.Dam.2017.11.009  0.429
2017 Bennett P, Dudek A, Laforge E. On the Number of Alternating Paths in Bipartite Complete Graphs Graphs and Combinatorics. 33: 307-320. DOI: 10.1007/S00373-017-1771-X  0.517
2017 Dudek A, Fleur SL, Mubayi D, Rödl V. On the Size-Ramsey Number of Hypergraphs Journal of Graph Theory. 86: 104-121. DOI: 10.1002/Jgt.22115  0.641
2016 Bennett P, Dudek A, Frieze AM, Helenius L. Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs Electronic Journal of Combinatorics. 23: 2-46. DOI: 10.37236/5709  0.325
2016 Bal D, Bennett P, Dudek A, Prałat P. The Total Acquisition Number of Random Graphs Electronic Journal of Combinatorics. 23: 2-55. DOI: 10.37236/5327  0.501
2016 Dudek A, Pralat P. Acquaintance time of random graphs near connectivity threshold Siam Journal On Discrete Mathematics. 30: 555-568. DOI: 10.1137/140969105  0.53
2016 Dudek AW. Corrigendum to Almost-Ramanujan graphs and prime gaps [European J. Combin., 43, (2015), 204-209] DOI: 10.1016/j.ejc.2014.09.001 European Journal of Combinatorics. 51: 533-534. DOI: 10.1016/j.ejc.2015.06.002  0.352
2016 Dudek A, Lesniak L. The vertex size-Ramsey number Discrete Mathematics. 339: 1753-1762. DOI: 10.1016/J.Disc.2016.02.001  0.548
2016 Dudek A, Mitsche D, Prałat P. The set chromatic number of random graphs Discrete Applied Mathematics. 215: 61-70. DOI: 10.1016/J.Dam.2016.07.011  0.476
2016 Dudek AW. On the Spectrum of the Generalised Petersen Graphs Graphs and Combinatorics. 1-8. DOI: 10.1007/s00373-016-1676-0  0.495
2015 Dudek A, Frieze AM, Tsourakakis CE. Rainbow connection of random regular graphs Siam Journal On Discrete Mathematics. 29: 2255-2266. DOI: 10.1137/140998433  0.544
2015 Dudek A, PraŁat P. An alternative proof of the linearity of the size-ramsey number of paths Combinatorics Probability and Computing. 24: 551-555. DOI: 10.1017/S096354831400056X  0.525
2015 Dudek A, Frieze A, Rucins̈ki A, Šileikis M. Loose Hamilton cycles in regular hypergraphs Combinatorics Probability and Computing. 24: 179-194. DOI: 10.1017/S0963548314000406  0.498
2015 Dudek AW. Almost-Ramanujan graphs and prime gaps European Journal of Combinatorics. 43: 204-209. DOI: 10.1016/j.ejc.2014.09.001  0.338
2014 Dudek A, Gordinowicz P, Prałat P. Cops and Robbers playing on edges The Journal of Combinatorics. 5: 131-153. DOI: 10.4310/Joc.2014.V5.N1.A6  0.323
2014 Dudek A. A note on a Ramsey-type problem for sequences Electronic Journal of Combinatorics. 21. DOI: 10.37236/4217  0.323
2014 Dudek A, Retter T, Rödl V. On generalized Ramsey umbers of Erdos and Rogers Journal of Combinatorial Theory. Series B. 109: 213-227. DOI: 10.1016/J.Jctb.2014.06.006  0.596
2014 Bal D, Bennett P, Dudek A, Frieze A. The t-Tone Chromatic Number of Random Graphs Graphs and Combinatorics. 30: 1073-1086. DOI: 10.1007/S00373-013-1341-9  0.577
2014 Beveridge A, Dudek A, Frieze A, Müller T, Stojaković M. Maker-breaker games on random geometric graphs Random Structures and Algorithms. 45: 553-607. DOI: 10.1002/Rsa.20572  0.527
2014 Dudek A, Mubayi D. On generalized ramsey numbers for 3-uniform hypergraphs Journal of Graph Theory. 76: 217-223. DOI: 10.1002/Jgt.21760  0.553
2013 Dudek A, Frieze A, Ruciński A, Šileikis M. Approximate counting of regular hypergraphs Information Processing Letters. 113: 785-788. DOI: 10.1016/J.Ipl.2013.07.018  0.415
2013 Dudek A, Frankl P, Rödl V. Some recent results on Ramsey-type numbers Discrete Applied Mathematics. 161: 1197-1202. DOI: 10.1016/J.Dam.2010.09.005  0.594
2013 Dudek A, Ferrara M. Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs Graphs and Combinatorics. 1-7. DOI: 10.1007/S00373-013-1391-Z  0.47
2013 Dudek A, Pikhurko O, Thomason A. On Minimum Saturated Matrices Graphs and Combinatorics. 29: 1269-1286. DOI: 10.1007/S00373-012-1199-2  0.361
2013 Dudek A, Frieze A. Tight Hamilton cycles in random uniform hypergraphs Random Structures and Algorithms. 42: 374-385. DOI: 10.1002/Rsa.20404  0.454
2012 Dudek A, Frieze A, Lohz PS, Speiss S. Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs Electronic Journal of Combinatorics. 19. DOI: 10.37236/2523  0.457
2012 Dudek A, Frieze A, Rucinski A. Rainbow Hamilton cycles in uniform hypergraphs Electronic Journal of Combinatorics. 19: 1-11. DOI: 10.37236/2055  0.504
2012 Beveridge A, Dudek A, Frieze A, Müller T. Cops and robbers on geometric graphs Combinatorics Probability and Computing. 21: 816-834. DOI: 10.1017/S0963548312000338  0.598
2012 Dudek A, Ramadurai R. Some remarks on vertex Folkman numbers for hypergraphs Discrete Mathematics. 312: 2952-2957. DOI: 10.1016/J.Disc.2012.06.014  0.43
2012 Dudek A, Schmitt JR. On the size and structure of graphs with a constant number of 1-factors Discrete Mathematics. 312: 1807-1811. DOI: 10.1016/J.Disc.2012.01.017  0.461
2012 Dudek A, Ramadurai R, Rödl V. On induced Folkman numbers Random Structures and Algorithms. 40: 493-500. DOI: 10.1002/Rsa.20397  0.643
2011 Dudek A, Frieze A. Loose Hamilton cycles in random uniform hypergraphs Electronic Journal of Combinatorics. 18: 1-14. DOI: 10.37236/477  0.486
2011 Bal D, Dudek A, Yilma ZB. On the maximum number of edges in a hypergraph with a unique perfect matching Discrete Mathematics. 311: 2577-2580. DOI: 10.1016/J.Disc.2011.07.016  0.435
2011 Dudek A, Rödl V. On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers Combinatorica. 31: 39-53. DOI: 10.1007/S00493-011-2626-3  0.638
2011 Dudek A, Ramadurai R. Vertex colorings of graphs without short odd cycles Journal of Graph Theory. 68: 255-264. DOI: 10.1002/Jgt.20557  0.518
2011 Dudek A, Wajc D. On the complexity of vertex-coloring edge-weightings Discrete Mathematics and Theoretical Computer Science. 13: 45-50.  0.368
2010 Bohman T, Dudek A, Frieze A, Pikhurko O. Flips in Graphs Siam Journal On Discrete Mathematics. 24: 1046-1055. DOI: 10.1137/090752237  0.498
2010 Dudek A, Rödl V. An almost quadratic bound on vertex Folkman numbers Journal of Combinatorial Theory, Series B. 100: 132-140. DOI: 10.1016/J.Jctb.2009.05.004  0.601
2010 Dudek A. On k-partite hypergraphs with the induced ε-density property Discrete Mathematics. 310: 1524-1530. DOI: 10.1016/J.Disc.2010.01.010  0.488
2010 Dudek A, Polcyn J, Ruciński A. Subhypergraph counts in extremal and random hypergraphs and the fractional q -independence Journal of Combinatorial Optimization. 19: 184-199. DOI: 10.1007/S10878-008-9174-9  0.349
2009 Dudek A, Franěk F, Rödl V. Cliques in Steiner systems Mathematica Slovaca. 59. DOI: 10.2478/S12175-008-0112-1  0.558
2009 DUDEK A, FRANKL P, RÖDL V. A Note on Universal and Canonically Coloured Sequences Combinatorics, Probability and Computing. 18: 683-689. DOI: 10.1017/S0963548309009961  0.505
2009 Dudek A, Năstase E, Rödl V. On k-chromatically connected graphs Discrete Mathematics. 309: 5547-5550. DOI: 10.1016/J.Disc.2008.03.023  0.664
2008 Dudek A, Rödl V. On the Turán Properties of Infinite Graphs The Electronic Journal of Combinatorics. 15. DOI: 10.37236/771  0.627
2008 Dudek A, Rödl V. On the Folkman Numberf(2, 3, 4) Experimental Mathematics. 17: 63-67. DOI: 10.1080/10586458.2008.10129023  0.659
2008 Dudek A, Rödl V. Finding Folkman Numbers via MAX CUT Problem Electronic Notes in Discrete Mathematics. 30: 99-104. DOI: 10.1016/J.Endm.2008.01.018  0.675
Show low-probability matches.