3 citations · 5 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2010★ 3 cited
The final size of the C_4-free process
Michael E. Picollelli
We consider the following random graph process: starting with n isolated vertices, add edges uniformly at random provided no such edge creates a copy of C_4. We show that, with pro…
math.CO2010★ 2 cited
The diamond-free process
Michael E. Picollelli
Let K_4^- denote the diamond graph, formed by removing an edge from the complete graph K_4. We consider the following random graph process: starting with n isolated vertices, add e…
math.CO2010
Set systems without a 3-simplex
Michael E. Picollelli
A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system o…