Geodesic
Large 2-coloured matchings in 3-coloured complete hypergraphs
Tamás Terpai1
1Université de Genève
The electronic journal of combinatorics, Tome 19 (2012) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove the generalized Ramsey-type result on large $2$-coloured matchings in a $3$-coloured complete $3$-uniform hypergraph, supporting a conjecture by A. Gyárfás.
DOI : 10.37236/2324
Classification : 05C55, 05C15, 05C65
Mots-clés : generalized Ramsey theory on hypergraphs

Tamás Terpai  1

1 Université de Genève 
@article{10_37236_2324,
     author = {Tam\'as Terpai},
     title = {Large 2-coloured matchings in 3-coloured complete hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {4},
     doi = {10.37236/2324},
     zbl = {1266.05095},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2324/}
}
TY  - JOUR
AU  - Tamás Terpai
TI  - Large 2-coloured matchings in 3-coloured complete hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2324/
DO  - 10.37236/2324
ID  - 10_37236_2324
ER  - 
%0 Journal Article
%A Tamás Terpai
%T Large 2-coloured matchings in 3-coloured complete hypergraphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2324/
%R 10.37236/2324
%F 10_37236_2324
Tamás Terpai. Large 2-coloured matchings in 3-coloured complete hypergraphs. The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2324

Cité par Sources :