✦ LIBER ✦

Core-like properties of infinite graphs and structures

✍ Scribed by B. Bauslaugh

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 554 KB
Volume: 138
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00191-k

No coin nor oath required. For personal study only.

✦ Synopsis

We define several properties of infinite graphs (structures) which are analogous to the property of being a core in a finite graph. We describe completely the relationships between these properties. We also show which of these properties are invariant under homomorphic equivalence.

📜 SIMILAR VOLUMES

Cores and Compactness of Infinite Direct

Cores and Compactness of Infinite Directed Graphs

✍ Bruce L. Bauslaugh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 665 KB

In this paper we define the property of homomorphic compactness for digraphs. We prove that if a digraph H is homomorphically compact then H has a core, although the converse does not hold. We also examine a weakened compactness condition and show that when this condition is assumed, compactness is

The menger-like property of the tree-wid

The menger-like property of the tree-width of infinite graphs

✍ Igor Kříž; Robin Thomas 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Infinite paths in planar graphs II, stru

Infinite paths in planar graphs II, structures and ladder nets

✍ Xingxing Yu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB 👁 1 views

## Abstract A graph is __k‐indivisible__, where __k__ is a positive integer, if the deletion of any finite set of vertices results in at most __k__ – 1 infinite components. In 1971, Nash‐Williams conjectured that a 4‐connected infinite planar graph contains a spanning 2‐way infinite path if and onl

Hereditary properties of combinatorial s

Hereditary properties of combinatorial structures: Posets and oriented graphs

✍ József Balogh; Béla Bollobás; Robert Morris 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract A hereditary property of combinatorial structures is a collection of structures (e.g., graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g., induced subgraphs), and contains arbitrarily large structures. Given a property $\cal {P}$, we write

Divisors and the spectrum of infinite gr

Divisors and the spectrum of infinite graphs

✍ Bojan Mohar; Matjaž Omladič 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 530 KB

On self-immersions of infinite graphs

✍ Thomas Andreae 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract The existence of an infinite graph which is not isomorphic to a proper minor of itself was proved by Oporowski. In the present note, it is shown that an analogous result holds when immersions are considered instead of minors. The question whether or not the same is true for weak immersi