default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLutz Warnke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Erlang Surya, Lutz Warnke:
On the Concentration of the Chromatic Number of Random Graphs. Electron. J. Comb. 31(1) (2024)- [j22]Lutz Warnke
:
Note on down-set thresholds. Random Struct. Algorithms 64(4): 807-813 (2024) - [i13]Manuel Fernandez V, Lutz Warnke:
The clique chromatic number of sparse random graphs. CoRR abs/2403.03013 (2024) - 2023
- [j21]He Guo, Kalen Patton, Lutz Warnke:
Prague Dimension of Random Graphs. Comb. 43(5): 853-884 (2023) - [j20]He Guo, Lutz Warnke:
Bounds on Ramsey games via alterations. J. Graph Theory 104(3): 470-484 (2023) - [j19]Lyuben Lichev, Dieter Mitsche, Lutz Warnke:
The jump of the clique chromatic number of random graphs. Random Struct. Algorithms 62(4): 1016-1034 (2023) - [j18]Erlang Surya, Lutz Warnke:
Lagrange Inversion Formula by Induction. Am. Math. Mon. 130(10): 944-948 (2023) - [j17]Lutz Warnke, Bill Correll Jr., Christopher N. Swanson:
The Density of Costas Arrays Decays Exponentially. IEEE Trans. Inf. Theory 69(1): 575-581 (2023) - [i12]Erlang Surya, Lutz Warnke, Emily Zhu:
Isomorphisms between dense random graphs. CoRR abs/2305.04850 (2023) - 2022
- [j16]He Guo, Lutz Warnke:
On the power of random greedy algorithms. Eur. J. Comb. 105: 103551 (2022) - [j15]Matas Sileikis, Lutz Warnke:
Counting extensions revisited. Random Struct. Algorithms 61(1): 3-30 (2022) - [i11]Erlang Surya, Lutz Warnke:
On the concentration of the chromatic number of random graphs. CoRR abs/2201.00906 (2022) - [i10]Michael Molloy, Erlang Surya, Lutz Warnke:
The degree-restricted random process is far from uniform. CoRR abs/2211.00835 (2022) - 2021
- [j14]Tolson Bell, Suchakree Chueluecha, Lutz Warnke:
Note on sunflowers. Discret. Math. 344(7): 112367 (2021) - [i9]He Guo, Lutz Warnke:
On the power of random greedy algorithms. CoRR abs/2104.07854 (2021) - [i8]Lyuben Lichev, Dieter Mitsche, Lutz Warnke:
The jump of the clique chromatic number of random graphs. CoRR abs/2105.12168 (2021) - 2020
- [j13]He Guo, Lutz Warnke:
Packing Nearly Optimal Ramsey R(3, t) Graphs. Comb. 40(1): 63-103 (2020) - [j12]Matas Sileikis, Lutz Warnke:
Upper Tail Bounds for Stars. Electron. J. Comb. 27(1): 1 (2020) - [j11]Lutz Warnke:
On the missing log in upper tail estimates. J. Comb. Theory, Ser. B 140: 98-146 (2020) - [i7]Tolson Bell, Suchakree Chueluecha, Lutz Warnke:
Note on Sunflowers. CoRR abs/2009.09327 (2020) - [i6]He Guo, Kalen Patton, Lutz Warnke:
Prague dimension of random graphs. CoRR abs/2011.09459 (2020)
2010 – 2019
- 2019
- [j10]Tom Bohman, Lutz Warnke:
Large girth approximate Steiner triple systems. J. Lond. Math. Soc. 100(3): 895-913 (2019) - [j9]Matas Sileikis, Lutz Warnke:
A counterexample to the DeMarco-Kahn upper tail conjecture. Random Struct. Algorithms 55(4): 775-794 (2019) - [i5]Svante Janson, Lutz Warnke:
Preferential attachment without vertex growth: emergence of the giant component. CoRR abs/1904.11861 (2019) - [i4]Lutz Warnke:
On Wormald's differential equation method. CoRR abs/1905.08928 (2019) - [i3]He Guo, Lutz Warnke:
Bounds on Ramsey Games via Alterations. CoRR abs/1909.02691 (2019) - 2017
- [i2]He Guo, Lutz Warnke:
Packing nearly optimal Ramsey R(3, t) graphs. CoRR abs/1711.05877 (2017) - 2016
- [j8]Oliver Riordan, Lutz Warnke:
Convergence of Achlioptas Processes via Differential Equations with Unique Solutions. Comb. Probab. Comput. 25(1): 154-171 (2016) - [j7]Lutz Warnke:
On the Method of Typical Bounded Differences. Comb. Probab. Comput. 25(2): 269-299 (2016) - [j6]Svante Janson, Lutz Warnke:
The lower tail: Poisson approximation revisited. Random Struct. Algorithms 48(2): 219-246 (2016) - 2015
- [j5]Oliver Riordan, Lutz Warnke:
The Janson inequalities for general up-sets. Random Struct. Algorithms 46(2): 391-395 (2015) - [j4]Oliver Riordan, Lutz Warnke:
The evolution of subcritical Achlioptas processes. Random Struct. Algorithms 47(1): 174-203 (2015) - 2014
- [j3]Lutz Warnke:
When does the K4-free process stop? Random Struct. Algorithms 44(3): 355-397 (2014) - [j2]Lutz Warnke:
The Cℓ-free process. Random Struct. Algorithms 44(4): 490-526 (2014) - 2012
- [i1]Lutz Warnke:
On the method of typical bounded differences. CoRR abs/1212.5796 (2012) - 2011
- [j1]Lutz Warnke:
Dense subgraphs in the H-free process. Discret. Math. 311(23-24): 2703-2707 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
