DOMINATING FUNCTIONS AND GRAPHS

Authors
DIESTEL R SHELAH S STEPRANS J
Citation
R. Diestel et al., DOMINATING FUNCTIONS AND GRAPHS, Journal of the London Mathematical Society, 49, 1994, pp. 16-24
Citations number
5
Categorie Soggetti
Mathematics, General",Mathematics
Journal title
Journal of the London Mathematical Society → ACNP
ISSN journal
00246107
Volume
49
Year of publication
1994
Part
1
Pages
16 - 24
Database
ISI
SICI code
0024-6107(1994)49:<16:DFAG>2.0.ZU;2-D
Abstract
A graph is called dominating if its vertices can be labelled with inte gers in such a way that for every function f:omega --> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obta in a characterization of these graphs by producing a small family of d ominating graphs with the property that every dominating graph must co ntain some member of the family.