A. Frieze

activity

20242026

collaborators

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

math.CO2026

Binomial Random Matroids

Patrick Bennett, Alan Frieze

Let $B = B_{k, n, p}$ be a random collection of $k$ -subsets of $[n]$ where each possible set is present independently with probability $p$ . Let $E_{B}$ …

math.CO2026

Coloring powers of random graphs

Alan Frieze, Ross Kang, Aditya Raut +2

Given a graph $G$ and an integer $r \geq 1$ , the $r$ th power $G^{r}$ of $G$ is the graph obtained from $G$ by adding edges for all pairs of distinct vertices at distance at most $r$ fr…

math.CO2026

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree

Colin Cooper, Alan Frieze

We study the existence of directed Hamilton cycles in random digraphs with $m$ edges where we condition on minimum in- and out-degree $\d \ge k+1$, where $k \geq 1$ . Denote such a r…

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.