Wesley Pegden

collaborators

9 papers

math.CO2026

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…

cs.AI2026

(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…

math.CO2026

Loose paths in random ordered hypergraphs

Andrzej Dudek, Alan Frieze, Wesley Pegden

We consider the length of {\em ordered loose paths} in the random $r$ -uniform hypergraph $H = H^{(r)} (n, p)$ . A ordered loose path is a sequence of edges $E_{1}, E_{2}, \dots, E_{ℓ}$ wher…

math.CO2025

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.

math.CO2025

Some Maker-Breaker games on hypergraphs

Patrick Bennett, Alan Frieze, Wesley Pegden

We consider some biased Maker-Breaker games. Starting with the complete $k$ -uniform hypergraph on $n$ vertices, at each turn Maker claims one edge, and then Breaker claims $b$ edge…

math.CO2025

Cover time of random subgraphs of the hypercube

Colin Cooper, Alan Frieze, Wesley Pegden

$Q_{n, p}$ , the random subgraph of the $n$ -vertex hypercube $Q_{n}$ , is obtained by independently retaining each edge of $Q_{n}$ with probability $p$ . We give precise values for the cov…