Dominating functions and graphs
逻辑
2016-09-06 v1
摘要
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these graphs by producing a small family of dominating graphs with the property that every dominating graph must contain some member of the family.
引用
@article{arxiv.math/9308215,
title = {Dominating functions and graphs},
author = {Reinhard Diestel and Saharon Shelah and Juris Steprāns},
journal= {arXiv preprint arXiv:math/9308215},
year = {2016}
}