34 citations · 42 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012
Spreading Processes and Large Components in Ordered, Directed Random Graphs
Paul Horn, Malik Magdon-Ismail
Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is re…
math.CO2010
Embedding a Forest in a Graph
Mark Goldberg, Malik Magdon-Ismail
For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are can be embedded in any graph containing at least vertices…