Twins of rayless graphs

DOI10.1016/j.jctb.2010.10.004zbMath1221.05039arXiv0911.3803OpenAlexW2065615449MaRDI QIDQ618035

Philipp Sprüssel, Anthony Bonato, Reinhard Diestel, Henning Bruhn

Publication date: 14 January 2011

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.3803

zbMATH Keywords

embeddinggraph homomorphisminfinite graphsrayless graphs

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Infinite graphs (05C63)

Related Items

The tree alternative conjecture under the topological minor relation ⋮ Equimorphy: the case of chains ⋮ COUNTING SIBLINGS IN UNIVERSAL THEORIES ⋮ A proof of the tree alternative conjecture under the topological minor relation ⋮ Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif ⋮ An example of Tateno disproving conjectures of Bonato-Tardif, Thomasse, and Tyomkyn ⋮ Siblings of an $\aleph_0$-categorical relational structure

Cites Work

• Unnamed Item
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Mutually embeddable graphs and the tree alternative conjecture
• A proof of the rooted tree alternative conjecture
• Minor-equivalence for infinite graphs
• The structure of rayless graphs
• There are uncountably many topological types of locally finite trees
• On the reconstruction of rayless infinite forests
• Large families of mutually embeddable vertex-transitive graphs
• A counterexample to Seymour's self‐minor conjecture
• Every rayless graph has an unfriendly partition