default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Luczak 0001
Tomasz Łuczak
Person information
- unicode name: Tomasz Łuczak
- affiliation: Adam Mickiewicz University, Poznań, Poland
Other persons with the same name
- Tomasz Luczak 0002 — Wrocław University of Environmental and Life Sciences, Wrocław, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j116]Tomasz Luczak
, Joanna Polcyn, Zahra Rahimi:
On the restricted size Ramsey number for a pair of cycles. Discret. Math. 347(4): 113891 (2024)- 2023
- [j115]Peter Allen, Tomasz Luczak, Joanna Polcyn, Yanbo Zhang:
The Ramsey number of a long even cycle versus a star. J. Comb. Theory B 162: 144-153 (2023) - 2022
- [j114]Tomasz Luczak, Joanna Polcyn, Christian Reiher:
On the Ramsey-Turán Density of Triangles. Comb. 42(1): 115-136 (2022) - [j113]Tomasz Luczak, Zahra Rahimi:
Long monochromatic even cycles in 3-edge-coloured graphs of large minimum degree. J. Graph Theory 99(4): 691-714 (2022) - 2021
- [j112]Tomasz Luczak, Joanna Polcyn, Christian Reiher:
Andrásfai and Vega graphs in Ramsey-Turán theory. J. Graph Theory 98(1): 57-80 (2021) - 2020
- [j111]Tomasz Luczak, Zahra Rahimi:
On Schelp's problem for three odd long cycles. J. Comb. Theory B 143: 1-15 (2020)
2010 – 2019
- 2019
- [j110]Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Asymmetry and structural information in preferential attachment graphs. Random Struct. Algorithms 55(3): 696-718 (2019) - [j109]Tomasz Luczak, Joanna Polcyn:
Paths in Hypergraphs: A Rescaling Phenomenon. SIAM J. Discret. Math. 33(4): 2251-2266 (2019) - [c6]Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Compression of Preferential Attachment Graphs. ISIT 2019: 1697-1701 - 2018
- [j108]Agnieszka Figaj, Tomasz Luczak:
The Ramsey Numbers for A Triple of Long Cycles. Comb. 38(4): 827-845 (2018) - [j107]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-Free Colourings of Graphs. Comb. Probab. Comput. 27(4): 623-642 (2018) - [j106]Tomasz Luczak, Yuval Peled:
Integral Homology of Random Simplicial Complexes. Discret. Comput. Geom. 59(1): 131-142 (2018) - [j105]Tomasz Luczak, Joanna Polcyn:
The multipartite Ramsey number for the 3-path of length three. Discret. Math. 341(5): 1270-1274 (2018) - [j104]Justyna Banaszak, Tomasz Luczak:
On the diameter of Kronecker graphs. Discret. Math. 341(11): 3165-3173 (2018) - [j103]Tomasz Luczak, Joanna Polcyn, Andrzej Rucinski:
On multicolor Ramsey numbers for loose k-paths of length three. Eur. J. Comb. 71: 43-50 (2018) - [j102]Tomasz Luczak, Joanna Polcyn, Christian Reiher:
A tale of stars and cliques. J. Comb. Theory A 160: 111-135 (2018) - 2017
- [j101]Tomasz Luczak, Joanna Polcyn:
On the Multicolor Ramsey Number for 3-Paths of Length Three. Electron. J. Comb. 24(1): 1 (2017) - [j100]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-free colorings of graphs. Electron. Notes Discret. Math. 61: 671-677 (2017) - 2016
- [j99]Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak:
Manipulative Waiters with Probabilistic Intuition. Comb. Probab. Comput. 25(6): 823-849 (2016) - [j98]Tomasz Luczak:
Highly connected monochromatic subgraphs of two-colored complete graphs. J. Comb. Theory B 117: 88-92 (2016) - [j97]Malgorzata Bednarska-Bzdega, Dan Hefetz, Tomasz Luczak:
Picker-Chooser fixed graph games. J. Comb. Theory B 119: 122-154 (2016) - 2015
- [j96]Tomasz Luczak, Lukasz Witkowski, Marcin Witkowski:
Hamilton cycles in random lifts of graphs. Eur. J. Comb. 49: 105-116 (2015) - [p2]Tomasz Luczak:
Randomly generated groups. Surveys in Combinatorics 2015: 175-194 - 2014
- [j95]Tomasz Luczak, Katarzyna Mieczkowska:
On Erdős' extremal problem on matchings in hypergraphs. J. Comb. Theory A 124: 178-194 (2014) - 2013
- [j94]Lior Aronshtam, Nathan Linial, Tomasz Luczak, Roy Meshulam:
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. Discret. Comput. Geom. 49(2): 317-334 (2013) - [j93]Norio Konno, Tomasz Luczak, Etsuo Segawa:
Limit measures of inhomogeneous discrete-time quantum walks in one dimension. Quantum Inf. Process. 12(1): 33-53 (2013) - [p1]Vitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak:
Dense Difference Sets and Their Combinatorial Structure. The Mathematics of Paul Erdős I 2013: 133-146 - 2012
- [j92]Peter Frankl, Tomasz Luczak, Katarzyna Mieczkowska:
On Matchings in Hypergraphs. Electron. J. Comb. 19(2): 42 (2012) - [j91]Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White:
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 57-87 (2012) - [j90]Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - [j89]Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak:
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. Comb. Probab. Comput. 21(4): 611-622 (2012) - [j88]Tomasz Luczak, Miklós Simonovits, Jozef Skokan:
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69(2): 169-175 (2012) - 2010
- [j87]Tomasz Luczak, Andrew Thomason:
Vicarious Graphs. Comb. Probab. Comput. 19(5-6): 819-827 (2010) - [j86]Tomasz Luczak, Pawel Pralat:
Chasing robbers on random graphs: Zigzag theorem. Random Struct. Algorithms 37(4): 516-524 (2010)
2000 – 2009
- 2009
- [j85]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18(1-2): 165-203 (2009) - [j84]Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Critical graphs for subpancyclicity of 3-connected claw-free graphs. J. Graph Theory 62(3): 263-278 (2009) - [j83]Tomasz Luczak, Taral Guldahl Seierstad:
The critical behavior of random digraphs. Random Struct. Algorithms 35(3): 271-293 (2009) - 2008
- [j82]Tomasz Luczak, Miklós Simonovits:
On the minimum degree forcing F-free graphs to be (nearly) bipartite. Discret. Math. 308(17): 3998-4002 (2008) - [j81]Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl:
Colorful Flowers. Electron. Notes Discret. Math. 31: 255-258 (2008) - [c5]Zbigniew Golebiewski, Miroslaw Kutylowski, Tomasz Luczak, Filip Zagórski:
Self-stabilizing population of mobile agents. IPDPS 2008: 1-8 - 2007
- [j80]Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky:
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16(3): 375-400 (2007) - [j79]Agnieszka Figaj, Tomasz Luczak:
The Ramsey number for a triple of long even cycles. J. Comb. Theory B 97(4): 584-596 (2007) - 2006
- [j78]Tomasz Luczak:
On The Structure Of Triangle-Free Graphs Of Large Minimum Degree. Comb. 26(4): 489-493 (2006) - [j77]Ronald J. Gould, Tomasz Luczak, John R. Schmitt:
Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size. Electron. J. Comb. 13(1) (2006) - [j76]Tomasz Luczak, Jaroslav Nesetril:
When is a random graph projective? Eur. J. Comb. 27(7): 1147-1154 (2006) - [j75]Tomasz Luczak, Pawel Pralat:
Protean Graphs. Internet Math. 3(1): 21-40 (2006) - [j74]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan:
The Ramsey number for hypergraph cycles I. J. Comb. Theory A 113(1): 67-83 (2006) - [j73]Malwina J. Luczak, Tomasz Luczak:
The phase transition in the cluster-scaled model of a random graph. Random Struct. Algorithms 28(2): 215-246 (2006) - [j72]Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak:
The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29(1): 105-120 (2006) - [j71]Tomasz Luczak, Jaroslav Nesetril:
A Probabilistic Approach to the Dichotomy Problem. SIAM J. Comput. 36(3): 835-843 (2006) - 2005
- [j70]Tomasz Luczak, Eric Vigoda:
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. J. Discrete Algorithms 3(1): 92-100 (2005) - 2004
- [j69]Tomasz Luczak, Jaroslav Nesetril:
Note on projective graphs. J. Graph Theory 47(2): 81-86 (2004) - [j68]Tomasz Luczak, Florian Pfender:
Claw-free 3-connected P11-free graphs are hamiltonian. J. Graph Theory 47(2): 111-121 (2004) - [j67]Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. J. Graph Theory 47(3): 183-202 (2004) - [c4]Marcin Gogolewski, Miroslaw Kutylowski, Tomasz Luczak:
Mobile Mixing. ICISC 2004: 380-393 - 2002
- [j66]Penny E. Haxell, Tomasz Luczak, P. W. Tingley:
Ramsey Numbers for Trees of Small Maximum Degree. Comb. 22(2): 287-320 (2002) - [j65]Izolda Gorgol, Tomasz Luczak:
On induced Ramsey numbers. Discret. Math. 251(1-3): 87-96 (2002) - [j64]Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski:
Vertex Ramsey Properties of Families of Graphs. J. Comb. Theory B 84(2): 240-248 (2002) - [j63]Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Ramsey Properties of Families of Graphs. J. Comb. Theory B 86(2): 413-419 (2002) - [j62]Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen:
On the discrepancy of combinatorial rectangles. Random Struct. Algorithms 21(3-4): 205-215 (2002) - 2001
- [j61]Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski:
On minimal Folkman graphs. Discret. Math. 236(1-3): 245-262 (2001) - [j60]Tomasz Luczak, Tomasz Schoen:
Sum-Free Subsets of Right Cancellative Semigroups. Eur. J. Comb. 22(7): 999-1002 (2001) - [j59]Malgorzata Bednarska, Tomasz Luczak:
Biased positional games and the phase transition. Random Struct. Algorithms 18(2): 141-152 (2001) - 2000
- [b1]Svante Janson, Tomasz Luczak, Andrzej Rucinski:
Random graphs. Wiley-Interscience series in discrete mathematics and optimization, Wiley 2000, ISBN 978-0-471-17541-4, pp. I-XI, 1-333 - [j58]Malgorzata Bednarska, Tomasz Luczak:
Biased Positional Games for Which Random Strategies are Nearly Optimal. Comb. 20(4): 477-488 (2000) - [j57]Penny E. Haxell, Tomasz Luczak:
Embedding trees into graphs of large girth. Discret. Math. 216(1-3): 273-278 (2000) - [j56]Tomasz Luczak:
On triangle-free random graphs. Random Struct. Algorithms 16(3): 260-276 (2000)
1990 – 1999
- 1999
- [j55]Wojciech Kordecki, Tomasz Luczak:
On the connectivity of random subsets of projective spaces. Discret. Math. 196(1-3): 207-217 (1999) - [j54]Tomasz Luczak:
R(Cn, Cn, Cn)<=(4+o(1)) n. J. Comb. Theory B 75(2): 174-187 (1999) - 1998
- [j53]Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7(1): 33-46 (1998) - [j52]Tomasz Luczak, Vojtech Rödl, Endre Szemerédi:
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Comb. Probab. Comput. 7(4): 423-436 (1998) - [j51]Tomasz Luczak, Vojtech Rödl, Tomasz Schoen:
Independent finite sums in graphs defined on the natural numbers. Discret. Math. 181(1-3): 289-294 (1998) - [j50]Tomasz Luczak:
Random trees and random graphs. Random Struct. Algorithms 13(3-4): 485-500 (1998) - [j49]Tomasz Luczak:
A Greedy Algorithm Estimating the Height of Random Trees. SIAM J. Discret. Math. 11(2): 318-329 (1998) - 1997
- [j48]Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
On K4-Free Subgraphs of Random Graphs. Comb. 17(2): 173-213 (1997) - [j47]Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak:
Graphs without short odd cycles are nearly bipartite. Discret. Math. 163(1-3): 279-284 (1997) - [j46]Michal Karonski, Tomasz Luczak:
The number of connected sparsely edged uniform hypergraphs. Discret. Math. 171(1-3): 153-167 (1997) - [j45]Tomasz Luczak, Edyta Szymanska:
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. J. Algorithms 25(2): 311-320 (1997) - [j44]Tomasz Luczak, Lubos Thoma:
Convergence of probabilities for the second order monadic properties of a random mapping. Random Struct. Algorithms 11(3): 277-295 (1997) - [j43]Tomasz Luczak, Wojciech Szpankowski:
A suboptimal lossy data compression based on approximate pattern matching. IEEE Trans. Inf. Theory 43(5): 1439-1451 (1997) - [j42]Tomasz Luczak, Wojciech Szpankowski:
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. IEEE Trans. Inf. Theory 43(6): 2064-2065 (1997) - [c3]Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena:
On the minimum number of edges giving maximum oriented chromatic number. Contemporary Trends in Discrete Mathematics 1997: 179-182 - 1996
- [j41]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Comb. 16(1): 107-122 (1996) - [j40]Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka:
On the evolution of a random tournament. Discret. Math. 148(1-3): 311-316 (1996) - [j39]Paul Erdös, András Gyárfás, Tomasz Luczak:
Graphs in which each C4 spans K4. Discret. Math. 154(1-3): 263-268 (1996) - [j38]Tomasz Luczak, Vojtech Rödl:
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree. J. Comb. Theory B 66(2): 324-333 (1996) - [j37]Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
Ramsey-type results for oriented trees. J. Graph Theory 22(1): 1-8 (1996) - 1995
- [j36]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. 4: 217-239 (1995) - [j35]Yoshiharu Kohayakawa, Tomasz Luczak:
Sparse Anti-Ramsey Graphs. J. Comb. Theory B 63(1): 146-152 (1995) - [j34]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. J. Comb. Theory B 64(2): 273-287 (1995) - [j33]Tomasz Luczak:
A Note on the Density of Sum-free Sets. J. Comb. Theory A 70(2): 334-336 (1995) - [j32]Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
Connectivity Properties of Random Subgraphs of the Cube. Random Struct. Algorithms 6(2/3): 221-230 (1995) - [j31]Tomasz Luczak, Saharon Shelah:
Convergence in Homogeneous Random Graphs. Random Struct. Algorithms 6(4): 371-393 (1995) - 1994
- [j30]Tomasz Luczak:
On Ramsey Minimal Graphs. Electron. J. Comb. 1 (1994) - [j29]Paul Erdös, András Gyárfás, Tomasz Luczak:
Independet Transversals in Sparse Partite Hypergraphs. Comb. Probab. Comput. 3: 293-296 (1994) - [j28]D. Frank Hsu, Tomasz Luczak:
On the k-diameter of k-regular k-connected graphs. Discret. Math. 133(1-3): 291-296 (1994) - [j27]Tomasz Luczak:
Phase transition phenomena in random discrete structures. Discret. Math. 136(1-3): 225-242 (1994) - [j26]Alan M. Frieze, Svante Janson, Tomasz Luczak:
Introduction. Random Struct. Algorithms 5(1): 1-3 (1994) - [j25]Paul Erdös, Tomasz Luczak:
Change of Leadership in a Random Graph Process. Random Struct. Algorithms 5(1): 243-252 (1994) - [j24]Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
On the Diameter and Radius of Random Subgraphs of the Cube. Random Struct. Algorithms 5(5): 627-648 (1994) - [c2]Tomasz Luczak, Wojciech Szpankowski:
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. CPM 1994: 102-112 - 1993
- [j23]Tomasz Luczak, László Pyber:
On Random Generation of the Symmetic Group. Comb. Probab. Comput. 2: 505-512 (1993) - [j22]Tomasz Luczak:
The size of the largest hole in a random graph. Discret. Math. 112(1-3): 151-163 (1993) - [j21]Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel:
The Birth of the Giant Component. Random Struct. Algorithms 4(3): 233-359 (1993) - [c1]Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak:
Approximations with Axis-Aligned Rectangles (Extended Abstract). FCT 1993: 244-255 - 1992
- [j20]Tomasz Luczak, Boris G. Pittel:
Componenets of Random Forests. Comb. Probab. Comput. 1: 35-52 (1992) - [j19]Jerzy Jaworski, Tomasz Luczak:
Cycles in a Uniform Graph Process. Comb. Probab. Comput. 1: 223-239 (1992) - [j18]Alan M. Frieze, Tomasz Luczak:
On the independence and chromatic numbers of random regular graphs. J. Comb. Theory B 54(1): 123-132 (1992) - [j17]Tomasz Luczak, Andrzej Rucinski, Bernd Voigt:
Ramsey properties of random graphs. J. Comb. Theory B 56(1): 55-68 (1992) - [j16]Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
The Evaluation of Random Subgraphs of the Cube. Random Struct. Algorithms 3(1): 55-90 (1992) - 1991
- [j15]Tomasz Luczak:
The chromatic number of random graphs. Comb. 11(1): 45-54 (1991) - [j14]Tomasz Luczak:
A note on the sharp concentration of the chromatic number of random graphs. Comb. 11(3): 295-297 (1991) - [j13]Tomasz Luczak:
Holes in random graphs. Discret. Appl. Math. 30(2-3): 213-219 (1991) - [j12]Tomasz Luczak:
Size and connectivity of the k-core of a random graph. Discret. Math. 91(1): 61-68 (1991) - [j11]Tomasz Luczak:
Cycles in random graphs. Discret. Math. 98(3): 231-236 (1991) - [j10]Tomasz Luczak:
How to deal with unlabeled random graphs. J. Graph Theory 15(3): 303-316 (1991) - [j9]Tomasz Luczak, Joel E. Cohen:
Stability of Vertices in Random Boolean Cellular Automata. Random Struct. Algorithms 2(3): 327-334 (1991) - [j8]Tomasz Luczak:
Cycles in a Random Graph Near the Critical Point. Random Struct. Algorithms 2(4): 421-441 (1991)