3 papers
math.CO2016
Triangulating Almost-Complete Graphs
Kim Nguyen Pham, Landon Settle, Kayla Wright +1
A triangle decomposition of a graph is a partition of the edges of into triangles. Two necessary conditions for to admit such a decomposition are that is a mul…
math.CO2013
Completions of epsilon-dense partial Latin squares; quasirandom k-colorings of graphs
Padraic Bartlett
A classical question in combinatorics is the following:\ given a partial Latin square , when can we complete to a Latin square ? In this paper, we investigate the class o…
math.CO2012
Completions of epsilon-dense partial Latin squares
Padraic Bartlett
A classical question in combinatorics is the following: given a partial latin square P, when can we complete P to a latin square L? In this paper, we will investigate the class of…