86 citations · 344 across the 93 of their papers we have counts for
7 papers · 1 filter
Rainbow Matchings and Hamilton Cycles in Random Graphs
Deepak Bal, Alan Frieze
Let be drawn uniformly from all -uniform, -partite hypergraphs where each part of the partition is a disjoint copy of . We let $HP^{(\k)}_{n,m,k}$ be an edg…
Rainbow Connection of Random Regular Graphs
Andrzej Dudek, Alan Frieze, Charalampos Tsourakakis
An edge colored graph is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph , d…
Maker-Breaker games on random geometric graphs
Andrew Beveridge, Andrzej Dudek, Alan Frieze +2
In a Maker-Breaker game on a graph , Breaker and Maker alternately claim edges of . Maker wins if, after all edges have been claimed, the graph induced by his edges has some…
The height of random -trees and related branching processes
Colin Cooper, Alan Frieze, Ryuhei Uehara
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum…
Loose Hamilton Cycles in Regular Hypergraphs
Andrzej Dudek, Alan Frieze, Andrzej Ruciński +1
We establish a relation between two uniform models of random -graphs (for constant ) on labeled vertices: , the random -graph with exactly edges, and…
Packing tree factors in random and pseudo-random graphs
Deepak Bal, Alan Frieze, Michael Krivelevich +1
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G cove…
Approximate counting of regular hypergraphs
Andrzej Dudek, Alan Frieze, Andrzej Ruciński +1
In this paper we asymptotically count -regular -uniform hypergraphs on vertices, provided is fixed and . In doing so, we extend to hypergraphs a sw…