Tomasz Łuczak
#22,332
Most Influential Person Now
Polish mathematician
Tomasz Łuczak's AcademicInfluence.com Rankings
Tomasz Łuczakmathematics Degrees
Mathematics
#1200
World Rank
#2009
Historical Rank
Combinatorics
#33
World Rank
#37
Historical Rank
Measure Theory
#439
World Rank
#630
Historical Rank
Download Badge
Mathematics
Why Is Tomasz Łuczak Influential?
(Suggest an Edit or Addition)According to Wikipedia, Tomasz Łuczak is a Polish mathematician and professor at Adam Mickiewicz University in Poznań and Emory University. His main field of research is combinatorics, specifically discrete structures, such as random graphs, and their chromatic number.
Tomasz Łuczak's Published Works
Published Works
- Random Graphs: Janson/Random (2000) (974)
- Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) (461)
- The Birth of the Giant Component (1993) (458)
- Edge weights and vertex colours (2004) (353)
- Component Behavior Near the Critical Point of the Random Graph Process (1990) (174)
- Unmodulated spin chains as universal quantum wires (2005) (165)
- The structure of a random graph at the point of the phase transition (1994) (145)
- Component behavior near the critical point of the random graph process (1990) (137)
- A suboptimal lossy data compression based on approximate pattern matching (1997) (115)
- The chromatic number of random graphs (1991) (108)
- Arithmetic progressions of length three in subsets of a random set (1996) (98)
- Size and connectivity of the k-core of a random graph (1991) (96)
- The phase transition in a random hypergraph (2002) (95)
- The Ramsey number for a triple of long even cycles (2007) (92)
- Limit measures of inhomogeneous discrete-time quantum walks in one dimension (2011) (92)
- A note on the sharp concentration of the chromatic number of random graphs (1991) (90)
- Majority bootstrap percolation on the random graph G(n,p) (2010) (89)
- Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes (2010) (88)
- The Induced Size-Ramsey Number of Cycles (1995) (86)
- Size and connectivity of the k-core of a random graph (1991) (85)
- On the independence and chromatic numbers of random regular graphs (1992) (79)
- Biased Positional Games for Which Random Strategies are Nearly Optimal (2000) (77)
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (1998) (77)
- Trapping a particle of a quantum walk on the line (2011) (77)
- Ramsey properties of random graphs (1992) (74)
- The Evaluation of Random Subgraphs of the Cube (1992) (71)
- Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles (1995) (69)
- On Random Generation of the Symmetric Group (1993) (64)
- OnK4-free subgraphs of random graphs (1997) (63)
- Chasing robbers on random graphs: Zigzag theorem (2010) (60)
- On the fractional dimension of sets of continued fractions (1997) (59)
- On the k-diameter of k-regular k-connected graphs (1994) (58)
- The Ramsey number for hypergraph cycles I (2006) (57)
- On Erdős' extremal problem on matchings in hypergraphs (2012) (55)
- Quasiperiodic dynamics of a quantum walk on the line. (2004) (55)
- Quantum walks on cycles (2003) (55)
- Turán's extremal problem in random graphs: Forbidding odd cycles (1996) (53)
- R(Cn,Cn,Cn)≤(4+o(1))n (1999) (53)
- Multiuser quantum communication networks (2006) (51)
- Cycles in a Random Graph Near the Critical Point (1991) (50)
- R(Cn, Cn, Cn)<=(4+o(1)) n (1999) (49)
- Large Cliques in a Power-Law Random Graph (2009) (47)
- The Chromatic Number (2011) (45)
- On Matchings in Hypergraphs (2012) (42)
- Random trees and random graphs (1998) (39)
- The phase transition in the evolution of random digraphs (1990) (39)
- Two critical periods in the evolution of random planar graphs (2010) (33)
- Random trees and random graphs (1998) (33)
- Components of Random Forests (1992) (33)
- The critical behavior of random digraphs (2009) (32)
- On triangle-free random graphs (2000) (31)
- Coloring dense graphs via VC-dimension (2010) (30)
- Sum-free sets in abelian groups (2001) (28)
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles (2009) (28)
- Integral Homology of Random Simplicial Complexes (2016) (27)
- Perfect matchings in random intersection graphs (2013) (27)
- Ramsey Numbers for Trees of Small Maximum Degree (2002) (27)
- On the multi‐colored Ramsey numbers of cycles (2010) (26)
- Monochromatic Cycles in 2-Coloured Graphs (2012) (26)
- The number of connected sparsely edged uniform hypergraphs (1997) (25)
- On The Structure Of Triangle-Free Graphs Of Large Minimum Degree (2006) (25)
- On The Structure Of Triangle-Free Graphs Of Large Minimum Degree (2006) (25)
- On the number of sparse connected graphs (1990) (24)
- Asymmetry and structural information in preferential attachment graphs (2016) (24)
- The phase transition in the cluster‐scaled model of a random graph (2006) (23)
- Tree-Matchings in Graph Processes (1991) (23)
- Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size (2006) (23)
- Claw‐free 3‐connected P11‐free graphs are hamiltonian (2004) (23)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (1997) (22)
- On Ramsey Minimal Graphs (1994) (22)
- On triangle-free random graphs (2000) (22)
- A note on restricted vertex ramsey numbers (1996) (21)
- Biased positional games and the phase transition (2001) (21)
- The chromatic number of random graphs at the double-jump threshold (1989) (20)
- Claw-free 3-connected P 11 -free graphs are hamiltonian (2004) (20)
- The Phase Transition (2011) (20)
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodym property (2008) (20)
- When does the zero-one law hold? (1991) (20)
- On the Number of Sparse Connected Graphs (1990) (20)
- On minimal Folkman graphs (2001) (20)
- Manipulative Waiters with Probabilistic Intuition (2014) (19)
- Random triangular groups at density $1/3$ (2013) (19)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (2012) (18)
- THE RAMSEY NUMBER FOR HYPERGRAPH CYCLES II (2007) (18)
- Critical probability bounds for two-dimensional site percolation models (1988) (18)
- A Probabilistic Approach to the Dichotomy Problem (2006) (16)
- Note on projective graphs (2004) (16)
- A Probabilistic Approach to the Dichotomy Problem (2006) (16)
- The phase transition in the cluster-scaled model of a random graph (2006) (16)
- On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree (1996) (16)
- The multipartite Ramsey number for the 3-path of length three (2017) (15)
- Protean Graphs (2006) (15)
- On the minimum number of edges giving maximum oriented chromatic number (1997) (15)
- The number of trees with large diameter (1995) (15)
- Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings (2005) (15)
- On the number of maximal sum-free sets (2000) (14)
- Randomness and regularity (2006) (14)
- On the maximal density of sum-free sets (2000) (14)
- Graphs without short odd cycles are nearly bipartite (1997) (13)
- Pancyclicity of 3‐connected graphs: Pairs of forbidden subgraphs (2004) (13)
- EXAMPLES OF NON-UNIFORM LIMITING DISTRIBUTIONS FOR THE QUANTUM WALK ON EVEN CYCLES (2004) (13)
- Maximal induced trees in sparse random graphs (1988) (13)
- On the Diameter and Radius of Random Subgraphs of the Cube (1994) (13)
- Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs (2004) (13)
- The Ramsey Numbers for A Triple of Long Cycles (2007) (13)
- Picker-Chooser fixed graph games (2014) (13)
- Collapse of random triangular groups: a closer look (2013) (12)
- Phase transition phenomena in random discrete structures (1994) (12)
- Cycles in a Uniform Graph Process (1992) (12)
- A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms (1994) (12)
- The chromatic number of random graphs (1991) (11)
- Tree-minimal graphs are almost regular (2012) (11)
- Stability of Vertices in Random Boolean Cellular Automata (1991) (11)
- Edge disjoint spanning trees in random graphs (1990) (11)
- On Infinite Sum-free Sets of Natural Numbers☆ (1997) (11)
- Cycles in random graphs (1991) (10)
- Connectivity Properties of Random Subgraphs of the Cube (1995) (10)
- Giant components in three-parameter random directed graphs (1992) (10)
- Convergence in Homogeneous Random Graphs (1995) (9)
- On Matchings and Hamiltonian Cycles in Subgraphs of Random Graphs (1987) (9)
- The automorphism group of random graphs with a given number of edges (1988) (9)
- An Exponential Bound for the Probability of a Specified Subgraph in a Random Graph (1988) (9)
- A lossy data compression based on an approximate pattern matching (1995) (9)
- A sharp threshold for collapse of the random triangular group (2014) (9)
- Independent Transversals in Sparse Partite Hypergraphs (1994) (9)
- On the evolution of a random tournament (1996) (9)
- On the discrepancy of combinatorial rectangles (2002) (8)
- Structural Information and Compression of Scale-Free Graphs (2017) (8)
- Embedding trees into graphs of large girth (2000) (8)
- First-Order Definability of Trees and Sparse Random Graphs (2005) (8)
- Trophic levels in community food webs (2005) (8)
- Counterexamples in AB percolation (1989) (8)
- Anagram-free colorings of graphs (2016) (8)
- Dense Difference Sets and Their Combinatorial Structure (2013) (8)
- Combinatorics, Geometry and Probability: On Random Generation of the Symmetric Group (1997) (8)
- The connectivity threshold for the min‐degree random graph process (2006) (8)
- On a problem of Konyagin (2008) (7)
- Independent finite sums in graphs defined on the natural numbers (1998) (7)
- Phase transition phenomena in random discrete structures (1994) (7)
- On Even-Degree Subgraphs of Linear Hypergraphs (2012) (7)
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables (2016) (7)
- The connectivity threshold for the min-degree random graph process (2006) (7)
- Compression of Preferential Attachment Graphs (2019) (7)
- On the Multicolor Ramsey Number for 3-Paths of Length Three (2016) (6)
- The size of the largest hole in a random graph (1993) (6)
- On random subsets of projective spaces (1991) (6)
- Anagram-Free Colourings of Graphs (2017) (6)
- First order properties of random posets (1991) (6)
- On nonatomic submeasures on N. II (2008) (6)
- The size of the largest hole in a random graph (1993) (6)
- On induced Ramsey numbers (2002) (6)
- On generalized shift graphs (2014) (6)
- Solid state conformation of the anomeric effect in 2-phosphoryl-, 2-thiophosphoryl- and 2-selenophosphoryl-substituted 1,3-dithiolanes (1997) (6)
- Highly connected monochromatic subgraphs of two-colored complete graphs (2016) (5)
- Change of Leadership in a Random Graph Process (1994) (5)
- Highly connected monochromatic subgraphs of two-colored complete graphs (2016) (5)
- Mobile Mixing (2004) (4)
- A Greedy Algorithm Estimating the Height of Random Trees (1998) (4)
- Approximations with Axis-Aligned Rectangles (Extended Abstract) (1993) (4)
- On the connectivity of random subsets of projective spaces (1999) (4)
- On k-leaf connectivity of a random graph (1988) (4)
- Ramsey-type results for oriented trees (1996) (4)
- Random Regular Graphs (2011) (4)
- On the Ramsey-Turán Density of Triangles (2020) (4)
- Andrásfai and Vega graphs in Ramsey–Turán theory (2020) (4)
- On strongly sum-free subsets of abelian groups (1996) (4)
- When is a random graph projective? (2006) (3)
- Hamilton cycles in random lifts of graphs (2013) (3)
- A note on the density of sum-free sets (1995) (3)
- Solution-free sets for linear equations (2003) (3)
- On Ramsey Minimal Graphs (1994) (3)
- A Note on Triangle-Free Graphs (1996) (3)
- Cycles in random graphs (1991) (3)
- Paths in Hypergraphs: A Rescaling Phenomenon (2017) (3)
- On multicolor Ramsey numbers for loose k-paths of length three (2017) (3)
- Sparse Anti-Ramsey Graphs (1995) (3)
- Vertex Ramsey Properties of Families of Graphs (2002) (3)
- A note on unique representation bases for the integers (2004) (3)
- On nonatomic submeasures on $${\mathbb{N}}$$. III (2008) (3)
- Convex hulls of dense balanced graphs (1992) (3)
- On Sum-free Sets of Natural Numbers (1995) (3)
- On Schelp's problem for three odd long cycles (2020) (3)
- Unmodulated spin chains as universal quantum wires (3 pages) (2005) (2)
- Sum-Free Subsets of Right Cancellative Semigroups (2001) (2)
- A tale of stars and cliques (2017) (2)
- How to deal with unlabeled Random graphs (1991) (2)
- Holes in random graphs (1991) (2)
- On the restricted size Ramsey number for a pair of cycles (2022) (2)
- Subgraphs of large minimal degree (1992) (2)
- Preferential Attachment Graphs are All But Asymmetric (2016) (2)
- A Note on the Density of Sum-free Sets (1995) (2)
- Random Triangular Groups (2015) (2)
- Convergence of probabilities for the second order monadic properties of a random mapping (1997) (2)
- Stratigraphy of a Random Acyclic Directed Graph: The Size of Trophic Levels in the Cascade Model (1993) (2)
- How to deal with unlabeled random graphs (1991) (1)
- Graphs in which each C4 spans K4 (1996) (1)
- The Ramsey number of a long even cycle versus a star (2020) (1)
- Critical graphs for subpancyclicity of 3‐connected claw‐free graphs (2009) (1)
- Balanced Extensions of Spare Graphs (1992) (1)
- Self-stabilizing population of mobile agents (2008) (1)
- On nonatomic submeasures on N . III (2008) (1)
- Ramsey Properties of Families of Graphs (2002) (1)
- Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree (2020) (1)
- On the minimum degree forcing F-free graphs to be (nearly) bipartite (2008) (1)
- When is a random graph projective (2006) (1)
- On the Ramsey-Tur\'an density of triangles (2020) (1)
- Limit measures of inhomogeneous discrete-time quantum walks in one dimension (2012) (1)
- TR-2011-007 Tree-minimal graphs are almost regular (2011) (0)
- Corrections Correction to “ A Suboptimal Lossy Date Compression Based on Approximate Pattern Matching ” (1998) (0)
- Critical graphs for subpancyclicity of 3-connected claw-free graphs (2009) (0)
- On the Ramsey-Turán Density of Triangles (2021) (0)
- Extremal and Ramsey Properties (2011) (0)
- Zero‐One Laws (2011) (0)
- Andr\'asfai and Vega graphs in Ramsey-Tur\'an theory] (2020) (0)
- Index of Notation (2011) (0)
- Small bases for finite groups (1998) (0)
- Structural Information in Graphs : Symmetries and Admissible Relabelings (2017) (0)
- On families of weakly dependent random variables (2011) (0)
- On the clique number of a random overlap graph (1994) (0)
- Manipulative waiters with probabilistic intuition Ma lgorzata Bednarska-Bzd ega (2015) (0)
- Endomorphisms of Partially Ordered Sets (1998) (0)
- Introduction (1994) (0)
- Randomly generated groups (2015) (0)
- MATH 690-Topics in Random Topology-Literature (2015) (0)
- On nonatomic submeasures on $${\mathbb{N}}$$ (2008) (0)
- The Ramsey Numbers for A Triple of Long Cycles (2017) (0)
- Systemic treatment of alopecia areata (2013) (0)
- On nonatomic submeasures on [FORMULA]. III (2009) (0)
- Title Large cliques in a power-law random graph Author ( s ) (2011) (0)
- ON THE DISCREPANCYOF COMBINATORIAL RECTANGLESNOGA (0)
- Vicarious Graphs (2009) (0)
- ON THE INDEPENDENCE NUMBER OF RANDOM REGULAR GRAPHS (1988) (0)
- Preferential Attachment Graphs Are All But Asymmetric ∗ July 6 , 2016 (2016) (0)
- On the diameter of Kronecker graphs (2016) (0)
- Quasiperiodic dynamics of coherent diffusion: a quantum walk approach (2004) (0)
- Random and Pseudo-Random Structures (2007) (0)
- Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching' (1997) (0)
- Exponentially Small Probabilities (2011) (0)
- Start with a set A ( 0 ) ⊆ V ( G ) of active vertices . At each time step , an inactive vertex becomes active if at least k of its neighbours are active (2009) (0)
- Integral Homology of Random Simplicial Complexes (2017) (0)
- Perfect matchings in random intersection graphs (2012) (0)
- Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes (2012) (0)
- On the diameter of Kronecker graphs (2016) (0)
This paper list is powered by the following services:
Other Resources About Tomasz Łuczak
What Schools Are Affiliated With Tomasz Łuczak?
Tomasz Łuczak is affiliated with the following schools: