We stand with Ukraine  

Lutz Warnke

Orcid: 0000-0002-1109-3957

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

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

Timeline

2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
3
6
3
1
3
4
3
2
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Note on down-set thresholds.
[BibTeX]
[DOI]
Lutz Warnke
Random Struct. Algorithms, July, 2024

The clique chromatic number of sparse random graphs.
[BibTeX]
[DOI]
Manuel Fernandez V
,
Lutz Warnke
CoRR, 2024

On the Concentration of the Chromatic Number of Random Graphs.
[BibTeX]
[DOI]
Erlang Surya
,
Lutz Warnke
Electron. J. Comb., 2024

2023
Lagrange Inversion Formula by Induction.
[BibTeX]
[DOI]
Erlang Surya
,
Lutz Warnke
Am. Math. Mon., November, 2023

Bounds on Ramsey games via alterations.
[BibTeX]
[DOI]
He Guo
,
Lutz Warnke
J. Graph Theory, November, 2023

Prague Dimension of Random Graphs.
[BibTeX]
[DOI]
He Guo
,
Kalen Patton
,
Lutz Warnke
Comb., October, 2023

The jump of the clique chromatic number of random graphs.
[BibTeX]
[DOI]
Lyuben Lichev
,
Dieter Mitsche
,
Lutz Warnke
Random Struct. Algorithms, July, 2023

The Density of Costas Arrays Decays Exponentially.
[BibTeX]
[DOI]
Lutz Warnke
,
Bill Correll Jr.
,
Christopher N. Swanson
IEEE Trans. Inf. Theory, 2023

Isomorphisms between dense random graphs.
[BibTeX]
[DOI]
Erlang Surya
,
Lutz Warnke
,
Emily Zhu
CoRR, 2023

2022
Counting extensions revisited.
[BibTeX]
[DOI]
Matas Sileikis
,
Lutz Warnke
Random Struct. Algorithms, 2022

On the power of random greedy algorithms.
[BibTeX]
[DOI]
He Guo
,
Lutz Warnke
Eur. J. Comb., 2022

The degree-restricted random process is far from uniform.
[BibTeX]
[DOI]
Michael Molloy
,
Erlang Surya
,
Lutz Warnke
CoRR, 2022

2021
Note on sunflowers.
[BibTeX]
[DOI]
Tolson Bell
,
Suchakree Chueluecha
,
Lutz Warnke
Discret. Math., 2021

2020
On the missing log in upper tail estimates.
[BibTeX]
[DOI]
Lutz Warnke
J. Comb. Theory, Ser. B, 2020

Upper Tail Bounds for Stars.
[BibTeX]
[DOI]
Matas Sileikis
,
Lutz Warnke
Electron. J. Comb., 2020

Packing Nearly Optimal Ramsey R(3, t) Graphs.
[BibTeX]
[DOI]
He Guo
,
Lutz Warnke
Comb., 2020

2019
A counterexample to the DeMarco-Kahn upper tail conjecture.
[BibTeX]
[DOI]
Matas Sileikis
,
Lutz Warnke
Random Struct. Algorithms, 2019

Large girth approximate Steiner triple systems.
[BibTeX]
[DOI]
Tom Bohman
,
Lutz Warnke
J. Lond. Math. Soc., 2019

On Wormald's differential equation method.
[BibTeX]
[DOI]
Lutz Warnke
CoRR, 2019

Preferential attachment without vertex growth: emergence of the giant component.
[BibTeX]
[DOI]
Svante Janson
,
Lutz Warnke
CoRR, 2019

2016
The lower tail: Poisson approximation revisited.
[BibTeX]
[DOI]
Svante Janson
,
Lutz Warnke
Random Struct. Algorithms, 2016

On the Method of Typical Bounded Differences.
[BibTeX]
[DOI]
Lutz Warnke
Comb. Probab. Comput., 2016

Convergence of Achlioptas Processes via Differential Equations with Unique Solutions.
[BibTeX]
[DOI]
Oliver Riordan
,
Lutz Warnke
Comb. Probab. Comput., 2016

2015
The evolution of subcritical Achlioptas processes.
[BibTeX]
[DOI]
Oliver Riordan
,
Lutz Warnke
Random Struct. Algorithms, 2015

The Janson inequalities for general up-sets.
[BibTeX]
[DOI]
Oliver Riordan
,
Lutz Warnke
Random Struct. Algorithms, 2015

2014
The <i>C</i><sub>ℓ</sub>-free process.
[BibTeX]
[DOI]
Lutz Warnke
Random Struct. Algorithms, 2014

When does the <i>K</i><sub>4</sub>-free process stop?
[BibTeX]
[DOI]
Lutz Warnke
Random Struct. Algorithms, 2014

2011
Dense subgraphs in the H-free process.
[BibTeX]
[DOI]
Lutz Warnke
Discret. Math., 2011


  Loading...