4 papers
Expected cost in Combinatorial Optimization under color constraints
Patrick Bennett, Alan Frieze, Wesley Pegden
We present an average case model of classical problems in combinatorial optimization where there are color constraints. In all cases we seek some (spanning) sub-structure of a comp…
Binomial Random Matroids
Patrick Bennett, Alan Frieze
Let be a random collection of -subsets of where each possible set is present independently with probability . Let …
On Minimum Cost Rainbow Structures
Patrick Bennett, Quentin Dubroff, Alan Frieze +1
We discuss the expected minimum cost of rainbow spanning trees and Hamilton cycles in randomly edge colored random graphs.
Some Maker-Breaker games on hypergraphs
Patrick Bennett, Alan Frieze, Wesley Pegden
We consider some biased Maker-Breaker games. Starting with the complete -uniform hypergraph on vertices, at each turn Maker claims one edge, and then Breaker claims edge…