Premium
Graphs omitting a bushy tree
Author(s) -
Cherlin G.,
Shi N.,
Tallgren L.
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199712)26:4<203::aid-jgt4>3.0.co;2-u
Subject(s) - mathematics , combinatorics , countable set , vertex (graph theory) , discrete mathematics , tree (set theory) , graph
A tree is called bushy if it has no vertex of degree 2. Theorem: the class of countable graphs omitting a fixed finite bushy tree with at least 5 vertices has no universal element. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 203–210, 1997