76 citations · 533 across the 32 of their papers we have counts for
32 papers
Lagrange Inversion Formula by Induction
Erlang Surya, Lutz Warnke
We present a simple inductive proof of the Lagrange Inversion Formula.
Isomorphisms between dense random graphs
Erlang Surya, Lutz Warnke, Emily Zhu
We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prov…
The degree-restricted random process is far from uniform
Michael Molloy, Erlang Surya, Lutz Warnke
The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it seq…
On the typical structure of graphs not containing a fixed vertex-critical subgraph
Oren Engelberg, Wojciech Samotij, Lutz Warnke
This work studies the typical structure of sparse -free graphs, that is, graphs that do not contain a subgraph isomorphic to a given graph . Extending the seminal result of O…
The jump of the clique chromatic number of random graphs
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In 2016 McDiarmid, Mitsche and Pralat noted…
On the power of random greedy algorithms
He Guo, Lutz Warnke
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induced bipartite subgraphs in triangle-free graphs and (ii) van der Waerden numbers.…