Tight co-degree condition for perfect matchings in 4-graphs

Andrzej Czygrinow; Vikram Kamat

doi:10.37236/2338

Tight co-degree condition for perfect matchings in 4-graphs

Andrzej Czygrinow, Vikram Kamat

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

Original language	English (US)
Pages (from-to)	1-16
Number of pages	16
Journal	Electronic Journal of Combinatorics
Volume	19
Issue number	2
DOIs	https://doi.org/10.37236/2338
State	Published - May 21 2012

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/2338

Cite this

@article{b93e5e01b97248cf9cfaefbdc2db4b87,

title = "Tight co-degree condition for perfect matchings in 4-graphs",

abstract = "We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.",

author = "Andrzej Czygrinow and Vikram Kamat",

year = "2012",

month = may,

day = "21",

doi = "10.37236/2338",

language = "English (US)",

volume = "19",

pages = "1--16",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2",

}

TY - JOUR

T1 - Tight co-degree condition for perfect matchings in 4-graphs

AU - Czygrinow, Andrzej

AU - Kamat, Vikram

PY - 2012/5/21

Y1 - 2012/5/21

N2 - We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

AB - We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

UR - http://www.scopus.com/inward/record.url?scp=84863451395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863451395&partnerID=8YFLogxK

U2 - 10.37236/2338

DO - 10.37236/2338

M3 - Article

AN - SCOPUS:84863451395

SN - 1077-8926

VL - 19

SP - 1

EP - 16

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2

ER -

Tight co-degree condition for perfect matchings in 4-graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this