Hereditarily indecomposable inverse limits of graphs

K. Kawamura; H. M. Tuncali; E. D. Tymchatyn

Displaying similar documents to “Hereditarily indecomposable inverse limits of graphs”

Homeomorphisms of composants of Knaster continua

Sonja Štimac (2002)

Fundamenta Mathematicae

Similarity:

The Knaster continuum $K_{p}$ is defined as the inverse limit of the pth degree tent map. On every composant of the Knaster continuum we introduce an order and we consider some special points of the composant. These are used to describe the structure of the composants. We then prove that, for any integer p ≥ 2, all composants of $K_{p}$ having no endpoints are homeomorphic. This generalizes Bandt’s result which concerns the case p = 2.

On Dimensionsgrad, resolutions, and chainable continua

Michael G. Charalambous, Jerzy Krzempek (2010)

Fundamenta Mathematicae

Similarity:

For each natural number n ≥ 1 and each pair of ordinals α,β with n ≤ α ≤ β ≤ ω(⁺), where ω(⁺) is the first ordinal of cardinality ⁺, we construct a continuum $S_{n, α, β}$ such that (a) $d i m S_{n, α, β} = n$ ; (b) $t r D g S_{n, α, β} = t r D g o S_{n, α, β} = α$ ; (c) $t r i n d S_{n, α, β} = t r I n d ₀ S_{n, α, β} = β$ ; (d) if β < ω(⁺), then $S_{n, α, β}$ is separable and first countable; (e) if n = 1, then $S_{n, α, β}$ can be made chainable or hereditarily decomposable; (f) if α = β < ω(⁺), then $S_{n, α, β}$ can be made hereditarily indecomposable; (g) if n = 1 and α = β < ω(⁺), then $S_{n, α, β}$ can be made chainable and hereditarily indecomposable. In...

Singular arc-like continua

Tadeusz Maćkowiak

Similarity:

CONTENTSIntroduction.......................................................................................................51. Preliminaries.................................................................................................6 A. Mappings....................................................................................................6 B. Arc-like continua.........................................................................................8 C. Pseudosuspensions...................................................................................8 D....

Arcwise accessibility in hyperspaces

Sam B. Nadler, Jr.

Similarity:

CONTENTS1. Introduction........................................................................................................ 52. Segmentwise accessibility..................................................................................... 73. Arcwise accessibility of singletons....................................................................... 84. Compacta in X which arcwise disconnect $2^{X}$ or C(X)................................ 155. Hereditary indecomposability and arcwise accessibility.....................................

A continuum $X$ such that $C (X)$ is not continuously homogeneous

Alejandro Illanes (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A metric continuum $X$ is said to be continuously homogeneous provided that for every two points $p, q \in X$ there exists a continuous surjective function $f : X \to X$ such that $f (p) = q$ . Answering a question by W.J. Charatonik and Z. Garncarek, in this paper we show a continuum $X$ such that the hyperspace of subcontinua of $X$ , $C (X)$ , is not continuously homogeneous.

On 𝓕-independence in graphs

Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Let be a set of graphs and for a graph G let $α_{} (G)$ and $α *_{} (G)$ denote the maximum order of an induced subgraph of G which does not contain a graph in as a subgraph and which does not contain a graph in as an induced subgraph, respectively. Lower bounds on $α_{} (G)$ and $α *_{} (G)$ are presented.

On the classification of inverse limits of tent maps

Louis Block, Slagjana Jakimovik, Lois Kailhofer, James Keesling (2005)

Fundamenta Mathematicae

Similarity:

Let $f_{s}$ and $f_{t}$ be tent maps on the unit interval. In this paper we give a new proof of the fact that if the critical points of $f_{s}$ and $f_{t}$ are periodic and the inverse limit spaces $(I, f_{s})$ and $(I, f_{t})$ are homeomorphic, then s = t. This theorem was first proved by Kailhofer. The new proof in this paper simplifies the proof of Kailhofer. Using the techniques of the paper we are also able to identify certain isotopies between homeomorphisms on the inverse limit space.

Extending generalized Whitney maps

Ivan Lončar (2017)

Archivum Mathematicum

Similarity:

For metrizable continua, there exists the well-known notion of a Whitney map. If $X$ is a nonempty, compact, and metric space, then any Whitney map for any closed subset of $2^{X}$ can be extended to a Whitney map for $2^{X}$ [3, 16.10 Theorem]. The main purpose of this paper is to prove some generalizations of this theorem.

Global continuum of positive solutions for discrete $p$ -Laplacian eigenvalue problems

Dingyong Bai, Yuming Chen (2015)

Applications of Mathematics

Similarity:

We discuss the discrete $p$ -Laplacian eigenvalue problem, $\{\begin{matrix} Δ (φ_{p} (Δ u (k - 1))) + λ a (k) g (u (k)) = 0, k \in {1, 2, ..., T}, \\ u (0) = u (T + 1) = 0, \end{matrix}$ where $T > 1$ is a given positive integer and $φ_{p} (x) : = {| x |}^{p - 2} x$ , $p > 1$ . First, the existence of an unbounded continuum $𝒞$ of positive solutions emanating from $(λ, u) = (0, 0)$ is shown under suitable conditions on the nonlinearity. Then, under an additional condition, it is shown that the positive solution is unique for any $λ > 0$ and all solutions are ordered. Thus the continuum $𝒞$ is a monotone continuous curve globally defined for all $λ > 0$ .

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

Éric Sopena (2012)

Discussiones Mathematicae Graph Theory

Similarity:

The oriented chromatic number of an oriented graph $^{\to} G$ is the minimum order of an oriented graph $^{\to} H$ such that $^{\to} G$ admits a homomorphism to $^{\to} H$ . The oriented chromatic number of an undirected graph G is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph G, defined as the minimum order of an oriented graph $^{\to} U$ such that every orientation $^{\to} G$ of G admits a homomorphism to $^{\to} U$ . We give...

Remarks on $D$ -integral complete multipartite graphs

Pavel Híc, Milan Pokorný (2016)

Czechoslovak Mathematical Journal

Similarity:

A graph is called distance integral (or $D$ -integral) if all eigenvalues of its distance matrix are integers. In their study of $D$ -integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs. We resolve these questions and present some further results on $D$ -integral complete multipartite graphs. We give the first known distance integral complete multipartite graphs $K_{p_{1}, p_{2}, p_{3}}$ with $p_{1} < p_{2} < p_{3}$ , and $K_{p_{1}, p_{2}, p_{3}, p_{4}}$ with $p_{1} < p_{2} < p_{3} < p_{4}$ , as well as the infinite classes of distance integral...

On characterization of uniquely 3-list colorable complete multipartite graphs

Yancai Zhao, Erfang Shan (2010)

Discussiones Mathematicae Graph Theory

Similarity:

For each vertex v of a graph G, if there exists a list of k colors, L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. Ghebleh and Mahmoodian characterized uniquely 3-list colorable complete multipartite graphs except for nine graphs: $K_{2, 2, r}$ r ∈ 4,5,6,7,8, $K_{2, 3, 4}$ , $K_{1 * 4, 4}$ , $K_{1 * 4, 5}$ , $K_{1 * 5, 4}$ . Also, they conjectured that the nine graphs are not U3LC graphs. After that, except for $K_{2, 2, r}$ r ∈ 4,5,6,7,8, the others have been proved not...

On two-to-one continuous functions

J. Mioduszewski

Similarity:

CONTENTSIntroduction................................................................................................................................................................................3I. General properties of k-to-one functions on locally compact spaces1. Multi-valued functions Ф and ψ......................................................................................................................................... 62. The proof of (I.11)..................................................................................................................................................................

Edge-colouring of graphs and hereditary graph properties

Samantha Dorfling, Tomáš Vetrík (2016)

Czechoslovak Mathematical Journal

Similarity:

Edge-colourings of graphs have been studied for decades. We study edge-colourings with respect to hereditary graph properties. For a graph $G$ , a hereditary graph property $𝒫$ and $l \geq 1$ we define $χ_{𝒫, l}^{'} (G)$ to be the minimum number of colours needed to properly colour the edges of $G$ , such that any subgraph of $G$ induced by edges coloured by (at most) $l$ colours is in $𝒫$ . We present a necessary and sufficient condition for the existence of $χ_{𝒫, l}^{'} (G)$ . We focus on edge-colourings of graphs with respect to the hereditary...

Nonempty intersection of longest paths in a graph with a small matching number

Fuyuan Chen (2015)

Czechoslovak Mathematical Journal

Similarity:

A maximum matching of a graph $G$ is a matching of $G$ with the largest number of edges. The matching number of a graph $G$ , denoted by $α^{'} (G)$ , is the number of edges in a maximum matching of $G$ . In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture...