83 citations · 346 across the 78 of their papers we have counts for
8 papers · 1 filter
Zero Forcing Number of Random Regular Graphs
Deepak Bal, Patrick Bennett, Sean English +2
The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become…
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…
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…
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
Xavier Perez-Gimenez, Pawel Pralat, Douglas B. West
An ordered hypergraph is a hypergraph with a specified linear ordering of the vertices, and the appearance of an ordered hypergraph in must respect the specified order…
A variant of the Erdos-Renyi random graph process
Adam Logan, Mike Molloy, Pawel Pralat
We consider a natural variant of the Erdős-Rényi random graph process in which vertices are special and are never put into the same connected component. The model is natural an…
Note on the multicolour size-Ramsey number for paths
Andrzej Dudek, Paweł Prałat
The size-Ramsey number of a graph is the smallest integer such that there exists a graph on edges with the property that any colouring of the edges o…
k-regular subgraphs near the k-core threshold of a random graph
Dieter Mitsche, Michael Molloy, Pawel Pralat
We prove that whp has a -regular subgraph if is at least above the threshold for the appearance of a subgraph with minimum degree at least ; i.e…
Clustering Properties of Spatial Preferential Attachment Model
Lenar Iskhakov, Bogumil Kaminski, Maksim Mironov +2
In this paper, we study the clustering properties of the Spatial Preferential Attachment (SPA) model introduced by Aiello et al. in 2009. This model naturally combines geometry and…