ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Discrete Mathematics
Volume 274, Issues 1-3, 6 January 2004, Pages 93-108
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (615 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0012-365X(03)00082-7    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

Cycles and perfect matchings

J. HaglundE-mail The Corresponding Author, a and J. B. RemmelE-mail The Corresponding Author, b

a Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395, USA b Department of Mathematics, University of California at San Diego, La Jolla, CA 92093-0112, USA

Received 22 October 2001; 
revised 14 January 2003; 
accepted 22 January 2003. ;
Available online 21 May 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Fan Chung and Ron Graham (J. Combin. Theory Ser. B 65 (1995) 273–290) introduced the cover polynomial for a directed graph and showed that it was connected with classical rook theory. Dworkin (J. Combin. Theory Ser. B 71 (1997) 17–53) showed that the cover polynomial naturally factors for directed graphs associated with Ferrers boards. The authors (Adv. Appl. Math. 27 (2001) 438–481) developed a rook theory for shifted Ferrers boards where the analogue of a rook placement is replaced by a partial perfect matching of K2n, the complete graph on 2n vertices. In this paper, we show that an analogue of Dworkin's result holds for shifted Ferrers boards in this setting. We also show how cycle-counting matching numbers are connected to cycle-counting “hit numbers” (which involve perfect matchings of K2n).

Author Keywords: Rook theory; Perfect matching; Cycles of permutations; Cover polynomial

Mathematical subject codes: 05A05

Article Outline

0. Introduction
1. Proof of Theorem 2
2. Special values of the cycle matching numbers
3. A cycle version of Theorem 1
References








Discrete Mathematics
Volume 274, Issues 1-3, 6 January 2004, Pages 93-108
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.