Name
Abstract | ||
|---|---|---|
Let T be a partial latin square and L be a latin square with [email protected]?L. We say that T is a latin trade if there exists a partial latin square T^' with T^'@[email protected] such that ([email protected]?T)@?T^' is a latin square. A k-homogeneous latin trade is one which intersects each row, each column and each entry either 0 or k times. In this paper, we construct 3-homogeneous latin trades from hexagonal packings of the plane with circles. We show that 3-homogeneous latin trades of size 3m exist for each m>=3. This paper discusses existence results for latin trades and provides a glueing construction which is subsequently used to construct all latin trades of finite order greater than three. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.disc.2005.04.021 | Discrete Mathematics |
Keywords | Field | DocType |
latin square,mathematics,circle packing | Discrete mathematics,Combinatorics,Homogeneous,Hexagonal crystal system,Latin square,Circle packing,Mathematics | Journal |
Volume | Issue | ISSN |
300 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.68 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas J. Cavenagh | 1 | 92 | 20.89 |
| Diane Donovan | 2 | 72 | 33.88 |
| Aleš Drápal | 3 | 35 | 12.73 |