Abstract
Grillet established conditions on a partially ordered set under which each maximal antichain meets each maximal chain. Chvátal made a conjecture in terms of graphs that strengthens Grillet's theorem. The purpose of this paper is to prove this conjecture. © 2004 Elsevier Inc. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 301-325 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 91 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Jul 2004 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
E-mail address: [email protected] (W. Zang). 1The work was partially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project CityU1056/01E). 2Supported by the fund from NSFC under Grant 10271065 and 60373025. 3Supported in part by the Research Grant Council of Hong Kong (Project HKU7109/01P).
RGC Funding Information
- RGC-funded
Fingerprint
Dive into the research topics of 'Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver