21 citations · 44 across the 25 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Maximal Cliques in Scale-Free Random Graphs
Thomas Bläsius, Maximillian Katzmann, Clara Stegehuis
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erdős-Rényi random graphs, inhomogeneous random gr…
math.CO2016★ 1 cited
Local and Union Boxicity
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
The boxicity of a graph is the smallest integer such that is the intersection of interval graphs, or equivalently, that is the intersect…