86 citations · 218 across the 38 of their papers we have counts for
62 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…
(Auto)formalization is supposed to be easy: Trellis process semantics for spelling out rigorous proofs
Wesley Pegden
We present Trellis: an autoformalization system that leverages LLM agents in a deterministically constrained workflow to enforce incremental progress in Lean autoformalization task…
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…
Cover time of random subgraphs of the hypercube
Colin Cooper, Alan Frieze, Wesley Pegden
, the random subgraph of the -vertex hypercube , is obtained by independently retaining each edge of with probability . We give precise values for the cov…
Structure-biased Maker-Breaker Games
Wesley Pegden, Francesca Yu
In classical Maker-Breaker games on graphs, Maker and Breaker take turns claiming edges; Maker's goal is to claim all of some structure (e.g., a spanning tree, Hamilton cycle, etc.…