32 citations · 60 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
The first order convergence law fails for random perfect graphs
Tobias Müller, Marc Noy
We consider first order expressible properties of random perfect graphs. That is, we pick a graph uniformly at random from all (labelled) perfect graphs on vertices and c…
math.CO2017★ 3 cited
Generalised Mycielski graphs and the Borsuk-Ulam theorem
Tobias Müller, Matěj Stehlík
Stiebitz determined the chromatic number of generalised Mycielski graphs using the topological method of Lovasz, which invokes the Borsuk-Ulam theorem. Van Ngoc and Tuza used eleme…