Universal graphs with a forbidden subtree

Simple item page
dc.creatorCherlin, Gregory
dc.creatorShelah, Saharon
dc.date2005-12-10
dc.date.accessioned2026-07-07T06:55:02Z
dc.date.available2026-07-07T06:55:02Z
dc.descriptionWe show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists.
dc.identifierhttps://arxiv.org/abs/math/0512218
dc.identifierhttp://arxiv.org/abs/math/0512218
dc.identifierJ. Combin. Theory Ser. B 97 No. 3 (2007) 293--333
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106157
dc.subjectLogic
dc.subjectCombinatorics
dc.titleUniversal graphs with a forbidden subtree
dc.typetext

Files

Collections

arXiv