3 citations · 6 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2020★ 3 cited
Hamilton Cycles in the Semi-random Graph Process
Pu Gao, Bogumil Kaminski, Calum MacRury +1
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…
math.CO2018
Clustering via Hypergraph Modularity
Bogumil Kaminski, Valerie Poulin, Pawel Pralat +2
Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs a…
math.CO2018
Subtrees of a random tree
Bogumil Kaminski, Pawel Pralat
Let be a random tree taken uniformly at random from the family of labelled trees on vertices. In this note, we provide bounds for , the number of sub-trees of tha…