Perfect Matchings of Cellular Graphs
dc.contributor.author | Ciucu, Mihai | en_US |
dc.date.accessioned | 2006-09-11T17:31:39Z | |
dc.date.available | 2006-09-11T17:31:39Z | |
dc.date.issued | 1996-04 | en_US |
dc.identifier.citation | Ciucu, Mihai; (1996). "Perfect Matchings of Cellular Graphs." Journal of Algebraic Combinatorics 5(2): 87-103. <http://hdl.handle.net/2027.42/46227> | en_US |
dc.identifier.issn | 0925-9899 | en_US |
dc.identifier.issn | 1572-9192 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/46227 | |
dc.description.abstract | We introduce a family of graphs, called cellular, and consider the problem of enumerating their perfect matchings. We prove that the number of perfect matchings of a cellular graph equals a power of 2 times the number of perfect matchings of a certain subgraph, called the core of the graph. This yields, as a special case, a new proof of the fact that the Aztec diamond graph of order n introduced by Elkies, Kuperberg, Larsen and Propp has exactly 2 n ( n +1)/2 perfect matchings. As further applications, we prove a recurrence for the number of perfect matchings of certain cellular graphs indexed by partitions, and we enumerate the perfect matchings of two other families of graphs called Aztec rectangles and Aztec triangles. | en_US |
dc.format.extent | 759599 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers-Plenum Publishers; Kluwer Academic Publishers ; Springer Science+Business Media | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Computer Science, General | en_US |
dc.subject.other | Group Theory and Generalizations | en_US |
dc.subject.other | Order, Lattices, Ordered Algebraic Structures | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Convex and Discrete Geometry | en_US |
dc.subject.other | Perfect Matching | en_US |
dc.subject.other | Alternating Sign Pattern | en_US |
dc.subject.other | Ferrers Diagram | en_US |
dc.title | Perfect Matchings of Cellular Graphs | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI, 48109-1003 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/46227/1/10801_2005_Article_418412.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1022408900061 | en_US |
dc.identifier.source | Journal of Algebraic Combinatorics | 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.