Lutz Warnke

Orcid: 0000-0002-1109-3957

According to our database1, Lutz Warnke authored at least 26 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Concentration of the Chromatic Number of Random Graphs.
Electron. J. Comb., 2024

2023
Lagrange Inversion Formula by Induction.
Am. Math. Mon., November, 2023

Bounds on Ramsey games via alterations.
J. Graph Theory, November, 2023

Prague Dimension of Random Graphs.
Comb., October, 2023

The Density of Costas Arrays Decays Exponentially.
IEEE Trans. Inf. Theory, 2023

Isomorphisms between dense random graphs.
CoRR, 2023

2022
Counting extensions revisited.
Random Struct. Algorithms, 2022

On the power of random greedy algorithms.
Eur. J. Comb., 2022

The degree-restricted random process is far from uniform.
CoRR, 2022

2021
Note on sunflowers.
Discret. Math., 2021

The jump of the clique chromatic number of random graphs.
CoRR, 2021

2020
On the missing log in upper tail estimates.
J. Comb. Theory, Ser. B, 2020

Upper Tail Bounds for Stars.
Electron. J. Comb., 2020

Packing Nearly Optimal Ramsey R(3, t) Graphs.
Comb., 2020

2019
A counterexample to the DeMarco-Kahn upper tail conjecture.
Random Struct. Algorithms, 2019

Large girth approximate Steiner triple systems.
J. Lond. Math. Soc., 2019

On Wormald's differential equation method.
CoRR, 2019

Preferential attachment without vertex growth: emergence of the giant component.
CoRR, 2019

2016
The lower tail: Poisson approximation revisited.
Random Struct. Algorithms, 2016

On the Method of Typical Bounded Differences.
Comb. Probab. Comput., 2016

Convergence of Achlioptas Processes via Differential Equations with Unique Solutions.
Comb. Probab. Comput., 2016

2015
The evolution of subcritical Achlioptas processes.
Random Struct. Algorithms, 2015

The Janson inequalities for general up-sets.
Random Struct. Algorithms, 2015

2014
The <i>C</i><sub>ℓ</sub>-free process.
Random Struct. Algorithms, 2014

When does the <i>K</i><sub>4</sub>-free process stop?
Random Struct. Algorithms, 2014

2011
Dense subgraphs in the H-free process.
Discret. Math., 2011


  Loading...