Geodesic
Coloring Four-uniform Hypergraphs on Nine Vertices
Canadian mathematical bulletin, Tome 58 (2015) no. 2, pp. 317-319

Voir la notice de l'article provenant de la source Cambridge

DOI

Every 4-uniform hypergraph on 9 vertices with at most 25 edges has property $\text{B}$ . This gives the answer ${{m}_{9}}\left( 4 \right)\,=\,26$ to a question raised by Erdős in 1968.
DOI : 10.4153/CMB-2015-008-7
Mots-clés : 05C15, property B, coloring hypergraphs 
Lewkowicz, Marek Kazimierz. Coloring Four-uniform Hypergraphs on Nine Vertices. Canadian mathematical bulletin, Tome 58 (2015) no. 2, pp. 317-319. doi: 10.4153/CMB-2015-008-7
@article{10_4153_CMB_2015_008_7,
     author = {Lewkowicz, Marek Kazimierz},
     title = {Coloring {Four-uniform} {Hypergraphs} on {Nine} {Vertices}},
     journal = {Canadian mathematical bulletin},
     pages = {317--319},
     year = {2015},
     volume = {58},
     number = {2},
     doi = {10.4153/CMB-2015-008-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2015-008-7/}
}
TY  - JOUR
AU  - Lewkowicz, Marek Kazimierz
TI  - Coloring Four-uniform Hypergraphs on Nine Vertices
JO  - Canadian mathematical bulletin
PY  - 2015
SP  - 317
EP  - 319
VL  - 58
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2015-008-7/
DO  - 10.4153/CMB-2015-008-7
ID  - 10_4153_CMB_2015_008_7
ER  - 
%0 Journal Article
%A Lewkowicz, Marek Kazimierz
%T Coloring Four-uniform Hypergraphs on Nine Vertices
%J Canadian mathematical bulletin
%D 2015
%P 317-319
%V 58
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-2015-008-7/
%R 10.4153/CMB-2015-008-7
%F 10_4153_CMB_2015_008_7

Cité par Sources :