Tomasz Luczak

According to our database1, Tomasz Luczak authored at least 119 papers between 1988 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
A tale of stars and cliques.
J. Comb. Theory, Ser. A, 2018

On multicolor Ramsey numbers for loose k-paths of length three.
Eur. J. Comb., 2018

The multipartite Ramsey number for the 3-path of length three.
Discrete Mathematics, 2018

On the diameter of Kronecker graphs.
Discrete Mathematics, 2018

Integral Homology of Random Simplicial Complexes.
Discrete & Computational Geometry, 2018

Anagram-Free Colourings of Graphs.
Combinatorics, Probability & Computing, 2018

The Ramsey Numbers for A Triple of Long Cycles.
Combinatorica, 2018

2017
Anagram-free colorings of graphs.
Electronic Notes in Discrete Mathematics, 2017

On the Multicolor Ramsey Number for 3-Paths of Length Three.
Electr. J. Comb., 2017

2016
Highly connected monochromatic subgraphs of two-colored complete graphs.
J. Comb. Theory, Ser. B, 2016

Picker-Chooser fixed graph games.
J. Comb. Theory, Ser. B, 2016

Manipulative Waiters with Probabilistic Intuition.
Combinatorics, Probability & Computing, 2016

2015
Hamilton cycles in random lifts of graphs.
Eur. J. Comb., 2015

Randomly generated groups.
Proceedings of the Surveys in Combinatorics 2015, 2015

2014
On Erdős' extremal problem on matchings in hypergraphs.
J. Comb. Theory, Ser. A, 2014

2013
Limit measures of inhomogeneous discrete-time quantum walks in one dimension.
Quantum Information Processing, 2013

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes.
Discrete & Computational Geometry, 2013

Investigation of Property Valuation Models Based on Decision Tree Ensembles Built over Noised Data.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2013

Dense Difference Sets and Their Combinatorial Structure.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
On the multi-colored Ramsey numbers of cycles.
Journal of Graph Theory, 2012

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges.
Combinatorics, Probability & Computing, 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

Monochromatic Cycles in 2-Coloured Graphs.
Combinatorics, Probability & Computing, 2012

On Matchings in Hypergraphs.
Electr. J. Comb., 2012

Investigation of Rotation Forest Method Applied to Property Price Prediction.
Proceedings of the Artificial Intelligence and Soft Computing, 2012

2011
Experimental Comparison of Resampling Methods in a Multi-Agent System to Assist with Property Valuation.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2011

Investigation of Random Subspace and Random Forest Methods Applied to Property Valuation Data.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2011

2010
Chasing robbers on random graphs: Zigzag theorem.
Random Struct. Algorithms, 2010

Vicarious Graphs.
Combinatorics, Probability & Computing, 2010

2009
The critical behavior of random digraphs.
Random Struct. Algorithms, 2009

Critical graphs for subpancyclicity of 3-connected claw-free graphs.
Journal of Graph Theory, 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability & Computing, 2009

2008
Colorful Flowers.
Electronic Notes in Discrete Mathematics, 2008

On the minimum degree forcing F-free graphs to be (nearly) bipartite.
Discrete Mathematics, 2008

Self-stabilizing population of mobile agents.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2007
The Ramsey number for a triple of long even cycles.
J. Comb. Theory, Ser. B, 2007

First-Order Definability of Trees and Sparse Random Graphs.
Combinatorics, Probability & Computing, 2007

2006
A Probabilistic Approach to the Dichotomy Problem.
SIAM J. Comput., 2006

The phase transition in the cluster-scaled model of a random graph.
Random Struct. Algorithms, 2006

The connectivity threshold for the min-degree random graph process.
Random Struct. Algorithms, 2006

The Ramsey number for hypergraph cycles I.
J. Comb. Theory, Ser. A, 2006

Protean Graphs.
Internet Mathematics, 2006

When is a random graph projective?
Eur. J. Comb., 2006

Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size.
Electr. J. Comb., 2006

On The Structure Of Triangle-Free Graphs Of Large Minimum Degree.
Combinatorica, 2006

2005
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings.
J. Discrete Algorithms, 2005

2004
Claw-free 3-connected P11-free graphs are hamiltonian.
Journal of Graph Theory, 2004

Note on projective graphs.
Journal of Graph Theory, 2004

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs.
Journal of Graph Theory, 2004

Mobile Mixing.
Proceedings of the Information Security and Cryptology, 2004

2002
On the discrepancy of combinatorial rectangles.
Random Struct. Algorithms, 2002

Vertex Ramsey Properties of Families of Graphs.
J. Comb. Theory, Ser. B, 2002

Ramsey Properties of Families of Graphs.
J. Comb. Theory, Ser. B, 2002

On induced Ramsey numbers.
Discrete Mathematics, 2002

Ramsey Numbers for Trees of Small Maximum Degree.
Combinatorica, 2002

2001
Biased positional games and the phase transition.
Random Struct. Algorithms, 2001

Sum-Free Subsets of Right Cancellative Semigroups.
Eur. J. Comb., 2001

On minimal Folkman graphs.
Discrete Mathematics, 2001

2000
On triangle-free random graphs.
Random Struct. Algorithms, 2000

Embedding trees into graphs of large girth.
Discrete Mathematics, 2000

Biased Positional Games for Which Random Strategies are Nearly Optimal.
Combinatorica, 2000

1999
R(Cn, Cn, Cn)<=(4+o(1)) n.
J. Comb. Theory, Ser. B, 1999

On the connectivity of random subsets of projective spaces.
Discrete Mathematics, 1999

1998
A Greedy Algorithm Estimating the Height of Random Trees.
SIAM J. Discrete Math., 1998

Random trees and random graphs.
Random Struct. Algorithms, 1998

Independent finite sums in graphs defined on the natural numbers.
Discrete Mathematics, 1998

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Combinatorics, Probability & Computing, 1998

Endomorphisms of Partially Ordered Sets.
Combinatorics, Probability & Computing, 1998

1997
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'.
IEEE Trans. Information Theory, 1997

A suboptimal lossy data compression based on approximate pattern matching.
IEEE Trans. Information Theory, 1997

Convergence of probabilities for the second order monadic properties of a random mapping.
Random Struct. Algorithms, 1997

A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph.
J. Algorithms, 1997

The number of connected sparsely edged uniform hypergraphs.
Discrete Mathematics, 1997

Graphs without short odd cycles are nearly bipartite.
Discrete Mathematics, 1997

On K4-Free Subgraphs of Random Graphs.
Combinatorica, 1997

On the minimum number of edges giving maximum oriented chromatic number.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
Ramsey-type results for oriented trees.
Journal of Graph Theory, 1996

On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.
J. Comb. Theory, Ser. B, 1996

On the evolution of a random tournament.
Discrete Mathematics, 1996

Graphs in which each C4 spans K4.
Discrete Mathematics, 1996

Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Combinatorica, 1996

1995
Convergence in Homogeneous Random Graphs.
Random Struct. Algorithms, 1995

Connectivity Properties of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1995

A Note on the Density of Sum-free Sets.
J. Comb. Theory, Ser. A, 1995

Sparse Anti-Ramsey Graphs.
J. Comb. Theory, Ser. B, 1995

Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory, Ser. B, 1995

The Induced Size-Ramsey Number of Cycles.
Combinatorics, Probability & Computing, 1995

1994
Introduction.
Random Struct. Algorithms, 1994

Change of Leadership in a Random Graph Process.
Random Struct. Algorithms, 1994

On the Diameter and Radius of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1994

Phase transition phenomena in random discrete structures.
Discrete Mathematics, 1994

On the k-diameter of k-regular k-connected graphs.
Discrete Mathematics, 1994

Independet Transversals in Sparse Partite Hypergraphs.
Combinatorics, Probability & Computing, 1994

On Ramsey Minimal Graphs.
Electr. J. Comb., 1994

A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993
The Birth of the Giant Component.
Random Struct. Algorithms, 1993

The size of the largest hole in a random graph.
Discrete Mathematics, 1993

On Random Generation of the Symmetic Group.
Combinatorics, Probability & Computing, 1993

Approximations with Axis-Aligned Rectangles (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
The Evaluation of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1992

Ramsey properties of random graphs.
J. Comb. Theory, Ser. B, 1992

On the independence and chromatic numbers of random regular graphs.
J. Comb. Theory, Ser. B, 1992

Componenets of Random Forests.
Combinatorics, Probability & Computing, 1992

Cycles in a Uniform Graph Process.
Combinatorics, Probability & Computing, 1992

1991
Tree-Matchings in Graph Processes.
SIAM J. Discrete Math., 1991

Stability of Vertices in Random Boolean Cellular Automata.
Random Struct. Algorithms, 1991

Cycles in a Random Graph Near the Critical Point.
Random Struct. Algorithms, 1991

How to deal with unlabeled random graphs.
Journal of Graph Theory, 1991

Cycles in random graphs.
Discrete Mathematics, 1991

Size and connectivity of the k-core of a random graph.
Discrete Mathematics, 1991

Holes in random graphs.
Discrete Applied Mathematics, 1991

A note on the sharp concentration of the chromatic number of random graphs.
Combinatorica, 1991

The chromatic number of random graphs.
Combinatorica, 1991

1990
Component Behavior Near the Critical Point of the Random Graph Process.
Random Struct. Algorithms, 1990

On the Number of Sparse Connected Graphs.
Random Struct. Algorithms, 1990

The phase transition in the evolution of random digraphs.
Journal of Graph Theory, 1990

1989
The chromatic number of random graphs at the double jump threshold.
Combinatorica, 1989

1988
On k-leaf connectivity of a random graph.
Journal of Graph Theory, 1988

Maximal induced trees in sparse random graphs.
Discrete Mathematics, 1988


  Loading...