76 citations · 533 across the 32 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 1 cited
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…
math.CO2021★ 3 cited
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…
math.CO2021★ 3 cited
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.…