Czygrinow, Andrzej and Kamat, Vikram (2012) Tight co-degree condition for perfect matchings in 4-graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 19 (2).
PDF
ele_jou_com_19_2_2012.pdf - Published Version Restricted to Registered users only Download (305kB) | Request a copy |
Official URL: http://dx.doi.org/10.1007/s00604-012-0787-4
Abstract
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.
Item Type: | Journal Article |
---|---|
Publication: | ELECTRONIC JOURNAL OF COMBINATORICS |
Publisher: | ELECTRONIC JOURNAL OF COMBINATORICS |
Additional Information: | Copy right for this article belongs to Electronic journal of combinatorics |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 14 Jul 2012 07:06 |
Last Modified: | 14 Jul 2012 07:06 |
URI: | http://eprints.iisc.ac.in/id/eprint/44690 |
Actions (login required)
View Item |