Sophia Park

collaborators

2 papers

math.CO2018

A Ramsey theorem for biased graphs

Peter Nelson, Sophia Park

A $bia se d g r a p h$ is a pair $(G, B)$ , where $G$ is a graph and $B$ is a collection of `balanced' circuits of $G$ such that no $Θ$ -subgraph of $G$ contains precis…

math.CO2017

Orthogonally Resolvable Matching Designs

Peter Danziger, Sophia Park

An Orthogonally resolvable Matching Design OMD $(n, k)$ is a partition of the edges the complete graph $K_{n}$ into matchings of size $k$ , called blocks, such that the blocks can be r…