Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "induced-hereditary" wg kryterium: Wszystkie pola


Wyświetlanie 1-3 z 3
Tytuł:
Universality for and in Induced-Hereditary Graph Properties
Autorzy:
Broere, Izak
Heidema, Johannes
Powiązania:
https://bibliotekanauki.pl/articles/30146860.pdf
Data publikacji:
2013-03-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
countable graph
universal graph
induced-hereditary property
Opis:
The well-known Rado graph $R$ is universal in the set of all countable graphs \( \mathcal{I} \), since every countable graph is an induced subgraph of $R$. We study universality in \( \mathcal{I} \) and, using $R$, show the existence of $2^{\aleph_0}$ pairwise non-isomorphic graphs which are universal in \( \mathcal{I} \) and denumerably many other universal graphs in \( \mathcal{I} \) with prescribed attributes. Then we contrast universality for and universality in induced-hereditary properties of graphs and show that the overwhelming majority of induced-hereditary properties contain no universal graphs. This is made precise by showing that there are $ 2^{2^{\aleph_0 } }$ properties in the lattice $ \mathbb{K}_\le $ of induced-hereditary properties of which only at most $ 2^{\aleph_0} $ contain universal graphs. In a final section we discuss the outlook on future work; in particular the question of characterizing those induced-hereditary properties for which there is a universal graph in the property.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 1; 33-47
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Universality in Graph Properties with Degree Restrictions
Autorzy:
Broere, Izak
Heidema, Johannes
Mihók, Peter
Powiązania:
https://bibliotekanauki.pl/articles/30146518.pdf
Data publikacji:
2013-07-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
countable graph
universal graph
induced-hereditary
k-degenerate graph
graph with colouring number at most k + 1
graph property with assignment
Opis:
Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set ℐc of all countable graphs (since every graph in ℐc is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of ℐc is provided. We then construct a k-degenerate graph which is universal for the induced-hereditary property of finite k-degenerate graphs. In order to attempt the corresponding problem for the property of countable graphs with colouring number at most k + 1, the notion of a property with assignment is introduced and studied. Using this notion, we are able to construct a universal graph in this graph property and investigate its attributes.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 3; 477-492
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Quest for A Characterization of Hom-Properties of Finite Character
Autorzy:
Broere, Izak
Matsoha, Moroli D.V.
Heidema, Johannes
Powiązania:
https://bibliotekanauki.pl/articles/31340894.pdf
Data publikacji:
2016-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
(countable) graph
homomorphism (of graphs)
property of graphs
hom-property
(finitely-)induced-hereditary property
finitely determined property
(weakly) finite character
axiomatizable property
compactness theorems
core
connectedness
chromatic number
clique number
independence number
dominating set
Opis:
A graph property is a set of (countable) graphs. A homomorphism from a graph \( G \) to a graph \( H \) is an edge-preserving map from the vertex set of \( G \) into the vertex set of \( H \); if such a map exists, we write \( G \rightarrow H \). Given any graph \( H \), the hom-property \( \rightarrow H \) is the set of \( H \)-colourable graphs, i.e., the set of all graphs \( G \) satisfying \( G \rightarrow H \). A graph property \( mathcal{P} \) is of finite character if, whenever we have that \( F \in \mathcal{P} \) for every finite induced subgraph \( F \) of a graph \( G \), then we have that \( G \in \mathcal{P} \) too. We explore some of the relationships of the property attribute of being of finite character to other property attributes such as being finitely-induced-hereditary, being finitely determined, and being axiomatizable. We study the hom-properties of finite character, and prove some necessary and some sufficient conditions on \( H \) for \( \rightarrow H \) to be of finite character. A notable (but known) sufficient condition is that \( H \) is a finite graph, and our new model-theoretic proof of this compactness result extends from hom-properties to all axiomatizable properties. In our quest to find an intrinsic characterization of those \( H \) for which \( \rightarrow H \) is of finite character, we find an example of an infinite connected graph with no finite core and chromatic number 3 but with hom-property not of finite character.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 2; 479-500
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies