Tight co-degree condition for perfect matchings in 4-graphs
| Data(s) |
01/05/2012
|
|---|---|
| Resumo |
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/44690/1/ele_jou_com_19_2_2012.pdf Czygrinow, Andrzej and Kamat, Vikram (2012) Tight co-degree condition for perfect matchings in 4-graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 19 (2). |
| Publicador |
ELECTRONIC JOURNAL OF COMBINATORICS |
| Relação |
http://dx.doi.org/10.1007/s00604-012-0787-4 http://eprints.iisc.ernet.in/44690/ |
| Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
| Tipo |
Journal Article NonPeerReviewed |
