On existence of compound perfect squared squares of small order
dc.contributor.author | Kazarinoff, Nicholas D. | en_US |
dc.contributor.author | Weitzenkamp, Roger | en_US |
dc.date.accessioned | 2006-04-17T16:40:21Z | |
dc.date.available | 2006-04-17T16:40:21Z | |
dc.date.issued | 1973-04 | en_US |
dc.identifier.citation | Kazarinoff, N. D., Weitzenkamp, Roger (1973/04)."On existence of compound perfect squared squares of small order." Journal of Combinatorial Theory, Series B 14(2): 163-179. <http://hdl.handle.net/2027.42/33904> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WHT-4D8DSD9-9B/2/c8654ac45d44a912a8124bb2244e59fa | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/33904 | |
dc.description.abstract | A compound perfect squared square must contain at least 22 subsquares. The proof utilizes elementary combinatoric and graph theoretic arguments and an extensive computer search. | en_US |
dc.format.extent | 1170958 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | On existence of compound perfect squared squares of small order | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan, Department of Mathematics, Ann Arbor, Michigan 48104, USA; State University of New York at Buffalo, Department of Mathematics, 4246 Ridge Lea Road, Amherst, New York 14226, USA. | en_US |
dc.contributor.affiliationum | University of Michigan, Department of Mathematics, Ann Arbor, Michigan 48104, USA; State University of New York at Buffalo, Department of Mathematics, 4246 Ridge Lea Road, Amherst, New York 14226, USA. | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/33904/1/0000169.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0095-8956(73)90061-0 | en_US |
dc.identifier.source | Journal of Combinatorial Theory, Series B | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.