Maximal antichains of isomorphic subgraphs of the Rado graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Chains of Isomorphic Subgraphs of the Rado Graph

The partial order 〈E(R) ∪ {∅},⊂〉, where E(R) is the set of isomorphic subgraphs of the Rado graph R, is investigated. The order types of maximal chains in this poset are characterized as the order types of compact sets of reals having the minimum non-isolated. 2000 Mathematics Subject Classification: 05C80, 06A05, 06A06.

متن کامل

Coloring Subgraphs of the Rado Graph

Given a universal binary countable homogeneous structure U and n ∈ ω, there is a partition of the induced n-element substructures of U into finitely many classes so that for any partition C0, C1, . . . , Cm−1 of such a class Q into finitely many parts there is a number k ∈ m and a copy U∗ of U in U so that all of the induced n-element substructures of U∗ which are in Q are also in Ck. The parti...

متن کامل

Isomorphic Subgraphs in a Graph

At the combinatorics meeting of this Proceedings J . Schönheim posed the following problem : Is it true, that every graph of n edges has two (not necessarily induced isomorphic edge disjoint subgraphs with say f edges? In the present note we answer this question in the affirmative . In fact we prove that every graph of n edges contains two isomorphic edge disjoint subgraphs with cn 2/3 edges an...

متن کامل

Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs

For a countable ultrahomogeneous graph G = 〈G, ρ〉 let P(G) denote the collection of sets A ⊂ G such that 〈A, ρ ∩ [A]〉 ∼= G. The order types of maximal chains in the poset 〈P(G) ∪ {∅},⊂〉 are characterized as: (I) the order types of compact sets of reals having the minimum nonisolated, if G is the Rado graph or the Henson graph Hn, for some n ≥ 3; (II) the order types of compact nowhere dense set...

متن کامل

determination of maximal singularity free zones in the workspace of parallel manipulator

due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2015

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil1509919k