105 citations · 254 across the 20 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.PR2015★ 1 cited
Consistent random vertex-orderings of graphs
Paul Balister, Béla Bollobás, Svante Janson
Given a hereditary graph property , consider distributions of random orderings of vertices of graphs that are preserved under isomorphisms and under…
math.FA2015
Random Geometric Graphs and Isometries of Normed Spaces
Paul Balister, Béla Bollobás, Karen Gunderson +2
Given a countable dense subset of a finite-dimensional normed space , and , we form a random graph on by joining, independently and with probability , each pai…
math.CO2015★ 3 cited
Limited packings of closed neighbourhoods in graphs
Paul N. Balister, Béla Bollobás, Karen Gunderson
The k-limited packing number, , of a graph , introduced by Gallant, Gunther, Hartnell, and Rall, is the maximum cardinality of a set of vertices of such that eve…