Geodesic
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
The electronic journal of combinatorics, Tome 9 (2002)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Erdős, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not $r$-choosable and the minimum number of edges in an $r$-uniform hypergraph that is not $2$-colorable (in the ordinary sense). In this note we use their ideas to derive similar correspondences for complete $k$-partite graphs and complete $k$-uniform $k$-partite hypergraphs.
DOI : 10.37236/1670
Classification : 05C15, 05C65
Mots-clés : hypergraph 
@article{10_37236_1670,
     author = {Alexandr Kostochka},
     title = {On a theorem of {Erd\H{o}s,} {Rubin,} and {Taylor} on choosability of complete bipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     doi = {10.37236/1670},
     zbl = {1005.05018},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1670/}
}
TY  - JOUR
AU  - Alexandr Kostochka
TI  - On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1670/
DO  - 10.37236/1670
ID  - 10_37236_1670
ER  - 
%0 Journal Article
%A Alexandr Kostochka
%T On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1670/
%R 10.37236/1670
%F 10_37236_1670
Alexandr Kostochka. On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1670

Cité par Sources :