Excluding a Countable Clique
نویسندگان
چکیده
منابع مشابه
Excluding a Countable Clique
We extend the excluded Kn minor theorem of Robertson and Seymour to infinite graphs, and deduce a structural characterization of the infinite graphs that have no Kא0 minor. The latter is a refinement of an earlier characterization of Robertson, Seymour and the second author.
متن کاملExcluding a near-clique and a near-anticlique
Ramsey’s theorem says that for every clique H1 and for every graph H2 with no edges, all graphs containing neither of H1, H2 as induced subgraphs have bounded size. What if, instead, we exclude a graph H1 with a vertex whose deletion gives a clique, and the complement H2 of another such graph? This no longer implies bounded size, but it implies tightly restricted structure that we describe. The...
متن کاملClique-width of countable graphs: a compactness property
We de*ne the clique-width of a countable graph. We prove that a countable graph has *nite clique-width i+ its *nite induced subgraphs have bounded clique-width. We obtain an application to a conjecture concerning the structure of sets of countable graphs having a decidable monadic second-order satis*ability problem. c © 2003 Elsevier B.V. All rights reserved.
متن کاملExcluding a small minor
There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss the structure of graphs that do not contain a minor isomorphic to H.
متن کاملA local approach to the entropy of countable fuzzy partitions
This paper denes and investigates the ergodic proper-ties of the entropy of a countable partition of a fuzzy dynamical sys-tem at different points of the state space. It ultimately introducesthe local fuzzy entropy of a fuzzy dynamical system and proves itto be an isomorphism invariant.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1999
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1886