Non-minimal Degree-Sequence-Forcing Triples
نویسندگان
چکیده
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degreesequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A degreesequence-forcing set is minimal if no proper subset is degree-sequenceforcing. We characterize the non-minimal degree-sequence-forcing sets F when F has size 3. Mathematics Subject Classification (2000): 05C75, 05C07
منابع مشابه
Minimal forbidden sets for degree sequence characterizations
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. Barrus, Kumbhat, and Hartke [4] called F a degree-sequence-forcing (DSF) set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A DSF set is minimal if no proper subset is also DSF. In this paper, we present new properties of m...
متن کاملHow Special are Cohen and Random Forcings i.e. Boolean Algebras of the family of subsets of reals modulo meagre or null
We prove that any Souslin c.c.c. forcing notion which add a non dominated real add a Cohen real. We also prove that any Souslin c.c.c. forcing add a real which is not on any old narrow tree. The feeling that those two forcing notions -Cohen and Random(equivalently the corresponding Boolean algebras P(R)/(meagre sets), P(R)/(null sets)) are special, was probably old and widespread. A reasonable ...
متن کاملNon-gatherable Triples for Nonaffine Root Systems
This paper contains a complete description of minimal non-gatherable triangle triples in the lambda-sequences for the classical root systems, F4 and E6. Such sequences are associated with reduced decompositions (words) in affine and non-affine Weyl groups. The existence of the non-gatherable triples is a combinatorial obstacle for using the technique of intertwiners for an explicit description ...
متن کاملOn The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
متن کاملOn Sequences Generic in the Sense of Magidor
The main result of this paper is a combinatorial characterization of Magidor-generic sequences. Using this characterization, I show that the critical sequences of certain iterations are Magidor-generic over the target model. I then employ these results in order to analyze which other Magidor sequences exist in a Magidor extension. One result in this direction is that if we temporarily identify ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015