Geodesic
On the chromatic number of simple triangle-free triple systems
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A hypergraph is simple if every two edges share at most one vertex. It is triangle-free if in addition every three pairwise intersecting edges have a vertex in common. We prove that there is an absolute constant $c$ such that the chromatic number of a simple triangle-free triple system with maximum degree $\Delta$ is at most $c\sqrt{\Delta/\log \Delta}$. This extends a result of Johansson about graphs, and is sharp apart from the constant $c$.
DOI : 10.37236/845
Classification : 05C15, 05C65, 05B07
Mots-clés : hypergraph, chromatic number, triangle free triple system 
@article{10_37236_845,
     author = {Alan Frieze and Dhruv Mubayi},
     title = {On the chromatic number of simple triangle-free triple systems},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/845},
     zbl = {1165.05324},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/845/}
}
TY  - JOUR
AU  - Alan Frieze
AU  - Dhruv Mubayi
TI  - On the chromatic number of simple triangle-free triple systems
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/845/
DO  - 10.37236/845
ID  - 10_37236_845
ER  - 
%0 Journal Article
%A Alan Frieze
%A Dhruv Mubayi
%T On the chromatic number of simple triangle-free triple systems
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/845/
%R 10.37236/845
%F 10_37236_845
Alan Frieze; Dhruv Mubayi. On the chromatic number of simple triangle-free triple systems. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/845

Cité par Sources :