1 citations · 3 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph
Hüseyin Acan, Boris Pittel
A uniform attachment graph (with parameter ), denoted in the paper, is a random graph on the vertex set , where each vertex makes selections from …
math.CO2018★ 1 cited
Counting unlabeled interval graphs
Hüseyin Acan
We improve the bounds on the number of interval graphs on vertices. In particular, denoting by the quantity in question, we show that as $n\to \in…
math.CO2018
Permutations With Equal Orders
Huseyin Acan, Charles Burnette, Sean Eberhard +2
Let be the probability that two independent, uniformly random permutations of have the same order, and let be the probability that they are in the same conjugac…