Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 76, Issue 1 (2011), 1-33.
Cardinal characteristics on graphs
A cardinal characteristic can often be described as the smallest size of a family of sequences which has a given property. Instead of this traditional concern for a smallest realization of the given property, a basically new approach, taken in  and , asks for a realization whose members are sequences of labels that correspond to 1-way infinite paths in a labelled graph. We study this approach as such, establishing tools that are applicable to all these cardinal characteristics. As an application, we demonstrate the power of the tools developed by presenting a short proof of the bounded graph conjecture .
J. Symbolic Logic, Volume 76, Issue 1 (2011), 1-33.
First available in Project Euclid: 4 January 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Haverkamp, Nick. Cardinal characteristics on graphs. J. Symbolic Logic 76 (2011), no. 1, 1--33. doi:10.2178/jsl/1294170987. https://projecteuclid.org/euclid.jsl/1294170987