Tomasz Luczak

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 21

Top Venues

J. Comb. Theory, Ser. B

Discret. Math.

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

Tomasz Luczak, Joanna Polcyn, Zahra Rahimi
On the restricted size Ramsey number for a pair of cycles. Discret. Math. 347 (4) (2024)
Peter Allen, Tomasz Luczak, Joanna Polcyn, Yanbo Zhang
The Ramsey number of a long even cycle versus a star. J. Comb. Theory, Ser. B 162 (2023)
Tomasz Luczak, Joanna Polcyn, Christian Reiher
On the Ramsey-Turán Density of Triangles. Comb. 42 (1) (2022)
Tomasz Luczak, Zahra Rahimi
Long monochromatic even cycles in 3-edge-coloured graphs of large minimum degree. J. Graph Theory 99 (4) (2022)
Tomasz Luczak, Joanna Polcyn, Christian Reiher
Andrásfai and Vega graphs in Ramsey-Turán theory. J. Graph Theory 98 (1) (2021)
Tomasz Luczak, Zahra Rahimi
On Schelp's problem for three odd long cycles. J. Comb. Theory, Ser. B 143 (2020)
Tomasz Luczak, Abram Magner, Wojciech Szpankowski
Compression of Preferential Attachment Graphs. ISIT (2019)
Tomasz Luczak, Abram Magner, Wojciech Szpankowski
Asymmetry and structural information in preferential attachment graphs. Random Struct. Algorithms 55 (3) (2019)
Tomasz Luczak, Joanna Polcyn
Paths in Hypergraphs: A Rescaling Phenomenon. SIAM J. Discret. Math. 33 (4) (2019)
Tomasz Luczak, Joanna Polcyn, Christian Reiher
A tale of stars and cliques. J. Comb. Theory, Ser. A 160 (2018)
Nina Kamcev, Tomasz Luczak, Benny Sudakov
Anagram-Free Colourings of Graphs. Comb. Probab. Comput. 27 (4) (2018)
Tomasz Luczak, Joanna Polcyn, Andrzej Rucinski
On multicolor Ramsey numbers for loose k-paths of length three. Eur. J. Comb. 71 (2018)
Tomasz Luczak, Yuval Peled
Integral Homology of Random Simplicial Complexes. Discret. Comput. Geom. 59 (1) (2018)
Justyna Banaszak, Tomasz Luczak
On the diameter of Kronecker graphs. Discret. Math. 341 (11) (2018)
Agnieszka Figaj, Tomasz Luczak
The Ramsey Numbers for A Triple of Long Cycles. Comb. 38 (4) (2018)
Tomasz Luczak, Joanna Polcyn
The multipartite Ramsey number for the 3-path of length three. Discret. Math. 341 (5) (2018)
Tomasz Luczak, Joanna Polcyn
On the Multicolor Ramsey Number for 3-Paths of Length Three. Electron. J. Comb. 24 (1) (2017)
Nina Kamcev, Tomasz Luczak, Benny Sudakov
Anagram-free colorings of graphs. Electron. Notes Discret. Math. 61 (2017)
Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak
Manipulative Waiters with Probabilistic Intuition. Comb. Probab. Comput. 25 (6) (2016)
Tomasz Luczak
Highly connected monochromatic subgraphs of two-colored complete graphs. J. Comb. Theory, Ser. B 117 (2016)
Malgorzata Bednarska-Bzdega, Dan Hefetz, Tomasz Luczak
Picker-Chooser fixed graph games. J. Comb. Theory, Ser. B 119 (2016)
Tomasz Luczak, Lukasz Witkowski, Marcin Witkowski
Hamilton cycles in random lifts of graphs. Eur. J. Comb. 49 (2015)
Tomasz Luczak, Katarzyna Mieczkowska
On Erdős' extremal problem on matchings in hypergraphs. J. Comb. Theory, Ser. A 124 (2014)
Lior Aronshtam, Nathan Linial, Tomasz Luczak, Roy Meshulam
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. Discret. Comput. Geom. 49 (2) (2013)
Norio Konno, Tomasz Luczak, Etsuo Segawa
Limit measures of inhomogeneous discrete-time quantum walks in one dimension. Quantum Inf. Process. 12 (1) (2013)
Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. Comb. Probab. Comput. 21 (4) (2012)
Tomasz Luczak, Miklós Simonovits, Jozef Skokan
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69 (2) (2012)
Peter Frankl, Tomasz Luczak, Katarzyna Mieczkowska
On Matchings in Hypergraphs. Electron. J. Comb. 19 (2) (2012)
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) (2012)
Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
Tomasz Luczak, Andrew Thomason
Vicarious Graphs. Comb. Probab. Comput. 19 (5-6) (2010)
Tomasz Luczak, Pawel Pralat
Chasing robbers on random graphs: Zigzag theorem. Random Struct. Algorithms 37 (4) (2010)
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) (2009)
Ronald J. Gould, Tomasz Luczak, Florian Pfender
Critical graphs for subpancyclicity of 3-connected claw-free graphs. J. Graph Theory 62 (3) (2009)
Tomasz Luczak, Taral Guldahl Seierstad
The critical behavior of random digraphs. Random Struct. Algorithms 35 (3) (2009)
Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl
Colorful Flowers. Electron. Notes Discret. Math. 31 (2008)
Tomasz Luczak, Miklós Simonovits
On the minimum degree forcing F-free graphs to be (nearly) bipartite. Discret. Math. 308 (17) (2008)
Zbigniew Golebiewski, Miroslaw Kutylowski, Tomasz Luczak, Filip Zagórski
Self-stabilizing population of mobile agents. IPDPS (2008)
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) (2007)
Agnieszka Figaj, Tomasz Luczak
The Ramsey number for a triple of long even cycles. J. Comb. Theory, Ser. B 97 (4) (2007)
Tomasz Luczak
On The Structure Of Triangle-Free Graphs Of Large Minimum Degree. Comb. 26 (4) (2006)
Tomasz Luczak, Jaroslav Nesetril
When is a random graph projective? Eur. J. Comb. 27 (7) (2006)
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, Ser. A 113 (1) (2006)
Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak
The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29 (1) (2006)
Ronald J. Gould, Tomasz Luczak, John R. Schmitt
Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size. Electron. J. Comb. 13 (1) (2006)
Tomasz Luczak, Pawel Pralat
Protean Graphs. Internet Math. 3 (1) (2006)
Tomasz Luczak, Jaroslav Nesetril
A Probabilistic Approach to the Dichotomy Problem. SIAM J. Comput. 36 (3) (2006)
Malwina J. Luczak, Tomasz Luczak
The phase transition in the cluster-scaled model of a random graph. Random Struct. Algorithms 28 (2) (2006)
Tomasz Luczak, Eric Vigoda
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. J. Discrete Algorithms 3 (1) (2005)
Tomasz Luczak, Jaroslav Nesetril
Note on projective graphs. J. Graph Theory 47 (2) (2004)
Tomasz Luczak, Florian Pfender
-free graphs are hamiltonian. J. Graph Theory 47 (2) (2004)
Ronald J. Gould, Tomasz Luczak, Florian Pfender
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. J. Graph Theory 47 (3) (2004)
Marcin Gogolewski, Miroslaw Kutylowski, Tomasz Luczak
Mobile Mixing. ICISC (2004)
Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen
On the discrepancy of combinatorial rectangles. Random Struct. Algorithms 21 (3-4) (2002)
Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
Ramsey Properties of Families of Graphs. J. Comb. Theory, Ser. B 86 (2) (2002)
Izolda Gorgol, Tomasz Luczak
On induced Ramsey numbers. Discret. Math. 251 (1-3) (2002)
Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
Vertex Ramsey Properties of Families of Graphs. J. Comb. Theory, Ser. B 84 (2) (2002)
Penny E. Haxell, Tomasz Luczak, P. W. Tingley
Ramsey Numbers for Trees of Small Maximum Degree. Comb. 22 (2) (2002)
Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
On minimal Folkman graphs. Discret. Math. 236 (1-3) (2001)
Tomasz Luczak, Tomasz Schoen
Sum-Free Subsets of Right Cancellative Semigroups. Eur. J. Comb. 22 (7) (2001)
Malgorzata Bednarska, Tomasz Luczak
Biased positional games and the phase transition. Random Struct. Algorithms 18 (2) (2001)
Malgorzata Bednarska, Tomasz Luczak
Biased Positional Games for Which Random Strategies are Nearly Optimal. Comb. 20 (4) (2000)
Penny E. Haxell, Tomasz Luczak
Embedding trees into graphs of large girth. Discret. Math. 216 (1-3) (2000)
Tomasz Luczak
On triangle-free random graphs. Random Struct. Algorithms 16 (3) (2000)
Tomasz Luczak
)<=(4+o(1)) n. J. Comb. Theory, Ser. B 75 (2) (1999)
Wojciech Kordecki, Tomasz Luczak
On the connectivity of random subsets of projective spaces. Discret. Math. 196 (1-3) (1999)
Tomasz Luczak
A Greedy Algorithm Estimating the Height of Random Trees. SIAM J. Discret. Math. 11 (2) (1998)
Tomasz Luczak
Random trees and random graphs. Random Struct. Algorithms 13 (3-4) (1998)
Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Comb. Probab. Comput. 7 (4) (1998)
Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7 (1) (1998)
Tomasz Luczak, Vojtech Rödl, Tomasz Schoen
Independent finite sums in graphs defined on the natural numbers. Discret. Math. 181 (1-3) (1998)
Tomasz Luczak, Wojciech Szpankowski
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. IEEE Trans. Inf. Theory 43 (6) (1997)
Tomasz Luczak, Edyta Szymanska
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. J. Algorithms 25 (2) (1997)
Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
Graphs without short odd cycles are nearly bipartite. Discret. Math. 163 (1-3) (1997)
Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
-Free Subgraphs of Random Graphs. Comb. 17 (2) (1997)
Michal Karonski, Tomasz Luczak
The number of connected sparsely edged uniform hypergraphs. Discret. Math. 171 (1-3) (1997)
Tomasz Luczak, Wojciech Szpankowski
A suboptimal lossy data compression based on approximate pattern matching. IEEE Trans. Inf. Theory 43 (5) (1997)
Tomasz Luczak, Lubos Thoma
Convergence of probabilities for the second order monadic properties of a random mapping. Random Struct. Algorithms 11 (3) (1997)
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)
Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
Ramsey-type results for oriented trees. J. Graph Theory 22 (1) (1996)
Paul Erdös, András Gyárfás, Tomasz Luczak
. Discret. Math. 154 (1-3) (1996)
Tomasz Luczak, Vojtech Rödl
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree. J. Comb. Theory, Ser. B 66 (2) (1996)
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Comb. 16 (1) (1996)
Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka
On the evolution of a random tournament. Discret. Math. 148 (1-3) (1996)
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. J. Comb. Theory, Ser. B 64 (2) (1995)
Tomasz Luczak
A Note on the Density of Sum-free Sets. J. Comb. Theory, Ser. A 70 (2) (1995)
Yoshiharu Kohayakawa, Tomasz Luczak
Sparse Anti-Ramsey Graphs. J. Comb. Theory, Ser. B 63 (1) (1995)
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. 4 (1995)
Tomasz Luczak, Saharon Shelah
Convergence in Homogeneous Random Graphs. Random Struct. Algorithms 6 (4) (1995)
Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
Connectivity Properties of Random Subgraphs of the Cube. Random Struct. Algorithms 6 (2/3) (1995)
Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
On the Diameter and Radius of Random Subgraphs of the Cube. Random Struct. Algorithms 5 (5) (1994)
Tomasz Luczak, Wojciech Szpankowski
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. CPM (1994)
Alan M. Frieze, Svante Janson, Tomasz Luczak
Introduction. Random Struct. Algorithms 5 (1) (1994)
Paul Erdös, Tomasz Luczak
Change of Leadership in a Random Graph Process. Random Struct. Algorithms 5 (1) (1994)
Tomasz Luczak
On Ramsey Minimal Graphs. Electron. J. Comb. 1 (1994)
Tomasz Luczak
Phase transition phenomena in random discrete structures. Discret. Math. 136 (1-3) (1994)
D. Frank Hsu, Tomasz Luczak
On the k-diameter of k-regular k-connected graphs. Discret. Math. 133 (1-3) (1994)
Paul Erdös, András Gyárfás, Tomasz Luczak
Independet Transversals in Sparse Partite Hypergraphs. Comb. Probab. Comput. 3 (1994)
Tomasz Luczak
The size of the largest hole in a random graph. Discret. Math. 112 (1-3) (1993)
Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak
Approximations with Axis-Aligned Rectangles (Extended Abstract). FCT (1993)

Tomasz Luczak.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tomasz Luczak