Maximal induced trees in sparse random graphs. - Tomasz Luczak 001; Zbigniew Palka (Discret. Math., 1988)

On k-leaf connectivity of a random graph. - Tomasz Luczak 001 (J. Graph Theory, 1988)

The chromatic number of random graphs at the double jump threshold. - Tomasz Luczak 001; John C. Wierman (Comb., 1989)

The phase transition in the evolution of random digraphs. - Tomasz Luczak 001 (J. Graph Theory, 1990)

On the Number of Sparse Connected Graphs. - Tomasz Luczak 001 (Random Struct. Algorithms, 1990)

Component Behavior Near the Critical Point of the Random Graph Process. - Tomasz Luczak 001 (Random Struct. Algorithms, 1990)

The chromatic number of random graphs. - Tomasz Luczak 001 (Comb., 1991)

A note on the sharp concentration of the chromatic number of random graphs. - Tomasz Luczak 001 (Comb., 1991)

Holes in random graphs. - Tomasz Luczak 001 (Discret. Appl. Math., 1991)

Size and connectivity of the k-core of a random graph. - Tomasz Luczak 001 (Discret. Math., 1991)

Cycles in random graphs. - Tomasz Luczak 001 (Discret. Math., 1991)

How to deal with unlabeled random graphs. - Tomasz Luczak 001 (J. Graph Theory, 1991)

Cycles in a Random Graph Near the Critical Point. - Tomasz Luczak 001 (Random Struct. Algorithms, 1991)

Stability of Vertices in Random Boolean Cellular Automata. - Tomasz Luczak 001; Joel E. Cohen (Random Struct. Algorithms, 1991)

Tree-Matchings in Graph Processes. - Tomasz Luczak 001; Andrzej Rucinski 001 (SIAM J. Discret. Math., 1991)

Cycles in a Uniform Graph Process. - Jerzy Jaworski; Tomasz Luczak 001 (Comb. Probab. Comput., 1992)

Componenets of Random Forests. - Tomasz Luczak 001; Boris G. Pittel (Comb. Probab. Comput., 1992)

On the independence and chromatic numbers of random regular graphs. - Alan M. Frieze; Tomasz Luczak 001 (J. Comb. Theory B, 1992)

Ramsey properties of random graphs. - Tomasz Luczak 001; Andrzej Rucinski 001; Bernd Voigt (J. Comb. Theory B, 1992)

The Evaluation of Random Subgraphs of the Cube. - Béla Bollobás; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Random Struct. Algorithms, 1992)

Approximations with Axis-Aligned Rectangles (Extended Abstract). - Paul Fischer; Klaus-Uwe Höffgen; Hanno Lefmann; Tomasz Luczak 001 (FCT, 1993)

On Random Generation of the Symmetic Group. - Tomasz Luczak 001; László Pyber (Comb. Probab. Comput., 1993)

The size of the largest hole in a random graph. - Tomasz Luczak 001 (Discret. Math., 1993)

The Birth of the Giant Component. - Svante Janson; Donald E. Knuth; Tomasz Luczak 001; Boris G. Pittel (Random Struct. Algorithms, 1993)

A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. - Tomasz Luczak 001; Wojciech Szpankowski (CPM, 1994)

On Ramsey Minimal Graphs. - Tomasz Luczak 001 (Electron. J. Comb., 1994)

Independet Transversals in Sparse Partite Hypergraphs. - Paul Erdös; András Gyárfás; Tomasz Luczak 001 (Comb. Probab. Comput., 1994)

On the k-diameter of k-regular k-connected graphs. - D. Frank Hsu; Tomasz Luczak 001 (Discret. Math., 1994)

Phase transition phenomena in random discrete structures. - Tomasz Luczak 001 (Discret. Math., 1994)

On the Diameter and Radius of Random Subgraphs of the Cube. - Béla Bollobás; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Random Struct. Algorithms, 1994)

Change of Leadership in a Random Graph Process. - Paul Erdös; Tomasz Luczak 001 (Random Struct. Algorithms, 1994)

Introduction. - Alan M. Frieze; Svante Janson; Tomasz Luczak 001 (Random Struct. Algorithms, 1994)

The Induced Size-Ramsey Number of Cycles. - Penny E. Haxell; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Comb. Probab. Comput., 1995)

Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. - Penny E. Haxell; Yoshiharu Kohayakawa; Tomasz Luczak 001 (J. Comb. Theory B, 1995)

Sparse Anti-Ramsey Graphs. - Yoshiharu Kohayakawa; Tomasz Luczak 001 (J. Comb. Theory B, 1995)

A Note on the Density of Sum-free Sets. - Tomasz Luczak 001 (J. Comb. Theory A, 1995)

Connectivity Properties of Random Subgraphs of the Cube. - Béla Bollobás; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Random Struct. Algorithms, 1995)

Convergence in Homogeneous Random Graphs. - Tomasz Luczak 001; Saharon Shelah (Random Struct. Algorithms, 1995)

Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. - Penny E. Haxell; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Comb., 1996)

Graphs in which each C4 spans K4. - Paul Erdös; András Gyárfás; Tomasz Luczak 001 (Discret. Math., 1996)

On the evolution of a random tournament. - Tomasz Luczak 001; Andrzej Rucinski 001; Jacek Gruszka (Discret. Math., 1996)

On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree. - Tomasz Luczak 001; Vojtech Rödl (J. Comb. Theory B, 1996)

Ramsey-type results for oriented trees. - Yoshiharu Kohayakawa; Tomasz Luczak 001; Vojtech Rödl (J. Graph Theory, 1996)

On the minimum number of edges giving maximum oriented chromatic number. - Alexandr V. Kostochka; Tomasz Luczak 001; Gábor Simonyi; Éric Sopena (Contemporary Trends in Discrete Mathematics, 1997)

On K4-Free Subgraphs of Random Graphs. - Yoshiharu Kohayakawa; Tomasz Luczak 001; Vojtech Rödl (Comb., 1997)

Graphs without short odd cycles are nearly bipartite. - Ervin Györi; Alexandr V. Kostochka; Tomasz Luczak 001 (Discret. Math., 1997)

The number of connected sparsely edged uniform hypergraphs. - Michal Karonski; Tomasz Luczak 001 (Discret. Math., 1997)

A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. - Tomasz Luczak 001; Edyta Szymanska (J. Algorithms, 1997)

Convergence of probabilities for the second order monadic properties of a random mapping. - Tomasz Luczak 001; Lubos Thoma (Random Struct. Algorithms, 1997)

A suboptimal lossy data compression based on approximate pattern matching. - Tomasz Luczak 001; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 1997)

Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. - Tomasz Luczak 001; Wojciech Szpankowski (IEEE Trans. Inf. Theory, 1997)

Endomorphisms of Partially Ordered Sets. - Dwight Duffus; Tomasz Luczak 001; Vojtech Rödl; Andrzej Rucinski 001 (Comb. Probab. Comput., 1998)

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. - Tomasz Luczak 001; Vojtech Rödl; Endre Szemerédi (Comb. Probab. Comput., 1998)

Independent finite sums in graphs defined on the natural numbers. - Tomasz Luczak 001; Vojtech Rödl; Tomasz Schoen (Discret. Math., 1998)

Random trees and random graphs. - Tomasz Luczak 001 (Random Struct. Algorithms, 1998)

A Greedy Algorithm Estimating the Height of Random Trees. - Tomasz Luczak 001 (SIAM J. Discret. Math., 1998)

On the connectivity of random subsets of projective spaces. - Wojciech Kordecki; Tomasz Luczak 001 (Discret. Math., 1999)

R(Cn, Cn, Cn)<=(4+o(1)) n. - Tomasz Luczak 001 (J. Comb. Theory B, 1999)

Random graphs. - Svante Janson; Tomasz Luczak 001; Andrzej Rucinski 001 (Wiley, 2000)

Biased Positional Games for Which Random Strategies are Nearly Optimal. - Malgorzata Bednarska; Tomasz Luczak 001 (Comb., 2000)

Embedding trees into graphs of large girth. - Penny E. Haxell; Tomasz Luczak 001 (Discret. Math., 2000)

On triangle-free random graphs. - Tomasz Luczak 001 (Random Struct. Algorithms, 2000)

On minimal Folkman graphs. - Tomasz Luczak 001; Andrzej Rucinski 001; Sebastian Urbanski (Discret. Math., 2001)

Sum-Free Subsets of Right Cancellative Semigroups. - Tomasz Luczak 001; Tomasz Schoen (Eur. J. Comb., 2001)

Biased positional games and the phase transition. - Malgorzata Bednarska; Tomasz Luczak 001 (Random Struct. Algorithms, 2001)

Ramsey Numbers for Trees of Small Maximum Degree. - Penny E. Haxell; Tomasz Luczak 001; P. W. Tingley (Comb., 2002)

On induced Ramsey numbers. - Izolda Gorgol; Tomasz Luczak 001 (Discret. Math., 2002)

Ramsey Properties of Families of Graphs. - Ronald L. Graham; Tomasz Luczak 001; Vojtech Rödl; Andrzej Rucinski 001 (J. Comb. Theory B, 2002)

Vertex Ramsey Properties of Families of Graphs. - Tomasz Luczak 001; Andrzej Rucinski 001; Sebastian Urbanski (J. Comb. Theory B, 2002)

On the discrepancy of combinatorial rectangles. - Noga Alon; Benjamin Doerr; Tomasz Luczak 001; Tomasz Schoen (Random Struct. Algorithms, 2002)

Mobile Mixing. - Marcin Gogolewski; Miroslaw Kutylowski; Tomasz Luczak 001 (ICISC, 2004)

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. - Ronald J. Gould; Tomasz Luczak 001; Florian Pfender (J. Graph Theory, 2004)

Note on projective graphs. - Tomasz Luczak 001; Jaroslav Nesetril (J. Graph Theory, 2004)

Claw-free 3-connected P11-free graphs are hamiltonian. - Tomasz Luczak 001; Florian Pfender (J. Graph Theory, 2004)

Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. - Tomasz Luczak 001; Eric Vigoda (J. Discrete Algorithms, 2005)

On The Structure Of Triangle-Free Graphs Of Large Minimum Degree. - Tomasz Luczak 001 (Comb., 2006)

Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size. - Ronald J. Gould; Tomasz Luczak 001; John R. Schmitt (Electron. J. Comb., 2006)

When is a random graph projective? - Tomasz Luczak 001; Jaroslav Nesetril (Eur. J. Comb., 2006)

Protean Graphs. - Tomasz Luczak 001; Pawel Pralat (Internet Math., 2006)

The Ramsey number for hypergraph cycles I. - Penny E. Haxell; Tomasz Luczak 001; Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001; Miklós Simonovits; Jozef Skokan (J. Comb. Theory A, 2006)

The connectivity threshold for the min-degree random graph process. - Mihyun Kang; Youngmee Koh; Sangwook Ree; Tomasz Luczak 001 (Random Struct. Algorithms, 2006)

The phase transition in the cluster-scaled model of a random graph. - Malwina J. Luczak; Tomasz Luczak 001 (Random Struct. Algorithms, 2006)

A Probabilistic Approach to the Dichotomy Problem. - Tomasz Luczak 001; Jaroslav Nesetril (SIAM J. Comput., 2006)

First-Order Definability of Trees and Sparse Random Graphs. - Tom Bohman; Alan M. Frieze; Tomasz Luczak 001; Oleg Pikhurko; Clifford D. Smyth; Joel Spencer; Oleg Verbitsky 001 (Comb. Probab. Comput., 2007)

The Ramsey number for a triple of long even cycles. - Agnieszka Figaj; Tomasz Luczak 001 (J. Comb. Theory B, 2007)

Self-stabilizing population of mobile agents. - Zbigniew Golebiewski; Miroslaw Kutylowski; Tomasz Luczak 001; Filip Zagórski (IPDPS, 2008)

On the minimum degree forcing F-free graphs to be (nearly) bipartite. - Tomasz Luczak 001; Miklós Simonovits (Discret. Math., 2008)

Colorful Flowers. - Christian Avart; Péter Komjáth; Tomasz Luczak 001; Vojtech Rödl (Electron. Notes Discret. Math., 2008)

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. - Penny E. Haxell; Tomasz Luczak 001; Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001; Jozef Skokan (Comb. Probab. Comput., 2009)

Critical graphs for subpancyclicity of 3-connected claw-free graphs. - Ronald J. Gould; Tomasz Luczak 001; Florian Pfender (J. Graph Theory, 2009)

The critical behavior of random digraphs. - Tomasz Luczak 001; Taral Guldahl Seierstad (Random Struct. Algorithms, 2009)

Vicarious Graphs. - Tomasz Luczak 001; Andrew Thomason 001 (Comb. Probab. Comput., 2010)

Chasing robbers on random graphs: Zigzag theorem. - Tomasz Luczak 001; Pawel Pralat (Random Struct. Algorithms, 2010)

On Matchings in Hypergraphs. - Peter Frankl; Tomasz Luczak 001; Katarzyna Mieczkowska (Electron. J. Comb., 2012)

Monochromatic Cycles in 2-Coloured Graphs. - Fabrício Siqueira Benevides; Tomasz Luczak 001; Alex Scott 001; Jozef Skokan; M. White (Comb. Probab. Comput., 2012)

On Even-Degree Subgraphs of Linear Hypergraphs. - Domingos Dellamonica Jr.; Penny E. Haxell; Tomasz Luczak 001; Dhruv Mubayi; Brendan Nagle; Yury Person; Vojtech Rödl; Mathias Schacht; Jacques Verstraëte (Comb. Probab. Comput., 2012)

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. - Alexandr V. Kostochka; Mohit Kumbhat; Tomasz Luczak 001 (Comb. Probab. Comput., 2012)

On the multi-colored Ramsey numbers of cycles. - Tomasz Luczak 001; Miklós Simonovits; Jozef Skokan (J. Graph Theory, 2012)

Dense Difference Sets and Their Combinatorial Structure. - Vitaly Bergelson; Paul Erdös; Neil Hindman; Tomasz Luczak 001 (The Mathematics of Paul Erdős I, 2013)

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. - Lior Aronshtam; Nathan Linial; Tomasz Luczak 001; Roy Meshulam (Discret. Comput. Geom., 2013)

Limit measures of inhomogeneous discrete-time quantum walks in one dimension. - Norio Konno; Tomasz Luczak 001; Etsuo Segawa (Quantum Inf. Process., 2013)

On Erdős' extremal problem on matchings in hypergraphs. - Tomasz Luczak 001; Katarzyna Mieczkowska (J. Comb. Theory A, 2014)

Randomly generated groups. - Tomasz Luczak 001 (Surveys in Combinatorics, 2015)

Hamilton cycles in random lifts of graphs. - Tomasz Luczak 001; Lukasz Witkowski; Marcin Witkowski (Eur. J. Comb., 2015)

Manipulative Waiters with Probabilistic Intuition. - Malgorzata Bednarska-Bzdega; Dan Hefetz; Michael Krivelevich; Tomasz Luczak 001 (Comb. Probab. Comput., 2016)

Picker-Chooser fixed graph games. - Malgorzata Bednarska-Bzdega; Dan Hefetz; Tomasz Luczak 001 (J. Comb. Theory B, 2016)

Highly connected monochromatic subgraphs of two-colored complete graphs. - Tomasz Luczak 001 (J. Comb. Theory B, 2016)

On the Multicolor Ramsey Number for 3-Paths of Length Three. - Tomasz Luczak 001; Joanna Polcyn (Electron. J. Comb., 2017)

Anagram-free colorings of graphs. - Nina Kamcev; Tomasz Luczak 001; Benny Sudakov (Electron. Notes Discret. Math., 2017)

The Ramsey Numbers for A Triple of Long Cycles. - Agnieszka Figaj; Tomasz Luczak 001 (Comb., 2018)

Anagram-Free Colourings of Graphs. - Nina Kamcev; Tomasz Luczak 001; Benny Sudakov (Comb. Probab. Comput., 2018)

Integral Homology of Random Simplicial Complexes. - Tomasz Luczak 001; Yuval Peled (Discret. Comput. Geom., 2018)

On the diameter of Kronecker graphs. - Justyna Banaszak; Tomasz Luczak 001 (Discret. Math., 2018)

The multipartite Ramsey number for the 3-path of length three. - Tomasz Luczak 001; Joanna Polcyn (Discret. Math., 2018)

On multicolor Ramsey numbers for loose k-paths of length three. - Tomasz Luczak 001; Joanna Polcyn; Andrzej Rucinski 001 (Eur. J. Comb., 2018)

A tale of stars and cliques. - Tomasz Luczak 001; Joanna Polcyn; Christian Reiher (J. Comb. Theory A, 2018)

Compression of Preferential Attachment Graphs. - Tomasz Luczak 001; Abram Magner; Wojciech Szpankowski (ISIT, 2019)

Asymmetry and structural information in preferential attachment graphs. - Tomasz Luczak 001; Abram Magner; Wojciech Szpankowski (Random Struct. Algorithms, 2019)

Paths in Hypergraphs: A Rescaling Phenomenon. - Tomasz Luczak 001; Joanna Polcyn (SIAM J. Discret. Math., 2019)

On Schelp's problem for three odd long cycles. - Tomasz Luczak 001; Zahra Rahimi (J. Comb. Theory B, 2020)

Andrásfai and Vega graphs in Ramsey-Turán theory. - Tomasz Luczak 001; Joanna Polcyn; Christian Reiher (J. Graph Theory, 2021)

On the Ramsey-Turán Density of Triangles. - Tomasz Luczak 001; Joanna Polcyn; Christian Reiher (Comb., 2022)

Long monochromatic even cycles in 3-edge-coloured graphs of large minimum degree. - Tomasz Luczak 001; Zahra Rahimi (J. Graph Theory, 2022)

The Ramsey number of a long even cycle versus a star. - Peter Allen 001; Tomasz Luczak 001; Joanna Polcyn; Yanbo Zhang (J. Comb. Theory B, 2023)

On the restricted size Ramsey number for a pair of cycles. - Tomasz Luczak 001; Joanna Polcyn; Zahra Rahimi (Discret. Math., 2024)

The next case of Andrásfai's conjecture. - Tomasz Luczak 001; Joanna Polcyn; Christian Reiher (J. Comb. Theory B, 2025)

Ramsey Numbers of Books versus Long Cycles. - Fu-Tao Hu; Qizhong Lin; Tomasz Luczak 001; Bo Ning 001; Xing Peng (SIAM J. Discret. Math., 2025)