4 citations · 8 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
The clique chromatic number of sparse random graphs
Manuel Fernandez, 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 this paper, we determine the order of ma…
math.PR2024★ 1 cited
Two-Point Concentration of the Domination Number of Random Graphs
Tom Bohman, Lutz Warnke, Emily Zhu
We show that the domination number of the binomial random graph G_{n,p} with edge-probability p is concentrated on two values for p \ge n^{-2/3+\eps}, and not concentrated on two v…