✦ LIBER ✦

A Weak Form of Connected Sets

✍ Scribed by Takashi Noiri

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 304 KB
Volume: 116
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19841160102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Splitting stationary sets from weak form

Splitting stationary sets from weak forms of Choice

✍ Paul Larson; Saharon Shelah 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

## Abstract Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below __λ__ of cofinality __θ__ into __λ__ many stationary sets, where __θ__ < __λ__ are regular cardinals. This is a continuation of [4] (© 2009 WILEY‐VCH Verlag GmbH &

S-continuous mappings, certain weak form

S-continuous mappings, certain weak forms of normality and strongly semilocally connected spaces

✍ J. K. Kohli 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

Weak forms of elimination of imaginaries

✍ Enrique Casanovas; Rafel Farré 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

## Abstract We study the degree of elimination of imaginaries needed for the three main applications: to have canonical bases for types over models, to define strong types as types over algebraically closed sets and to have a Galois correspondence between definably closed sets __B__ such that __A__

A weak-derivative form for linear hyperb

A weak-derivative form for linear hyperbolic systems

✍ Charlie H. Cooke; Tze-Jang Chen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,

Connectivity and separating sets of cage

Connectivity and separating sets of cages

✍ Jiang, Tao; Mubayi, Dhruv 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least g/2 , with equality only when distance g/2 occurs for at least two pairs of vertices in G[S]. This structural property is