Stacie Baumann

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Embedding equitable (s,p)-edge-colorings of $K_{n}$

Stacie Baumann, Mika Olufemi, Stafford Yerger

An $(s, p)$ -edge-coloring of a graph $G$ is an edge coloring using $s$ colors such that exactly $p$ colors appear at each vertex. To generalize the notion of proper edge-coloring, t…

math.CO2022

A Proof of the $(n, k, t)$ -Conjectures

Stacie Baumann, Joseph Briggs

An \emph{ $(n, k, t)$ -graph} is a graph on $n$ vertices in which every set of $k$ vertices contains a clique on $t$ vertices. Turán's Theorem, rephrased in terms of graph complements,…

Embedding equitable (s,p)-edge-colorings of Kn​

A Proof of the (n,k,t)-Conjectures

Embedding equitable (s,p)-edge-colorings of $K_{n}$

A Proof of the $(n, k, t)$ -Conjectures