Geodesic
Tight co-degree condition for perfect matchings in 4-graphs
Andrzej Czygrinow1 ; Vikram Kamat2
1Arizona State University
2Indian Institute of Science, Bangalore
The electronic journal of combinatorics, Tome 19 (2012) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.
DOI : 10.37236/2338
Classification : 05C70, 05C65
Mots-clés : hypergraphs, matchings

Andrzej Czygrinow  1   ; Vikram Kamat  2

1 Arizona State University
2 Indian Institute of Science, Bangalore 
@article{10_37236_2338,
     author = {Andrzej Czygrinow and Vikram Kamat},
     title = {Tight co-degree condition for perfect matchings in 4-graphs},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {2},
     doi = {10.37236/2338},
     zbl = {1244.05176},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2338/}
}
TY  - JOUR
AU  - Andrzej Czygrinow
AU  - Vikram Kamat
TI  - Tight co-degree condition for perfect matchings in 4-graphs
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2338/
DO  - 10.37236/2338
ID  - 10_37236_2338
ER  - 
%0 Journal Article
%A Andrzej Czygrinow
%A Vikram Kamat
%T Tight co-degree condition for perfect matchings in 4-graphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2338/
%R 10.37236/2338
%F 10_37236_2338
Andrzej Czygrinow; Vikram Kamat. Tight co-degree condition for perfect matchings in 4-graphs. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2338

Cité par Sources :