On colored designs-III: on lambda-colored H-designs, H having lambda edges
نویسندگان
چکیده
Let H be a graph having edges which has no loops and multiple edges. Complete results about the existence of colored designs CH |CK n with exactly colors, are established for 6 4 and for arbitrary when H is a matching or a star. In all cases when there is a design it can be chosen to be cyclic. Slightly less complete results are obtained when H is a path or a cycle. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Chromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملTricolore 3-designs in Type III codes
A split complete weight enumerator in six variables is used to study the 3-colored designs held by codewords of xed composition in Type III codes containing the all-one codeword. In particular the ternary Golay code contains 3-colored 3-designs. We conjecture that every weight class in a Type III code with the all-one codeword holds 3-colored 3-designs.
متن کاملOn k-colored Lambda Terms and Their Skeletons
The paper describes an application of logic programming to the modeling of difficult combinatorial properties of lambda terms, with focus on the class of simply typed terms. Lambda terms in de Bruijn notation are Motzkin trees (also called binary-unary trees) with indices at their leaves counting up on the path to the root the steps to their lambda binder. As a generalization of affine lambda t...
متن کاملTricolore designs in Type III codes
A split complete weight enumerator in six variables is used to study the colored designs held by codewords of xed composition in Type III codes containing the all one codeword In particular the ternary Golay code contains colored designs We conjecture that every weight class in a Type III code with the all one codeword holds colored designs Introduction Colored designs were introduced in to stu...
متن کاملA note on $lambda$-Aluthge transforms of operators
Let $A=U|A|$ be the polar decomposition of an operator $A$ on a Hilbert space $mathscr{H}$ and $lambdain(0,1)$. The $lambda$-Aluthge transform of $A$ is defined by $tilde{A}_lambda:=|A|^lambda U|A|^{1-lambda}$. In this paper we show that emph{i}) when $mathscr{N}(|A|)=0$, $A$ is self-adjoint if and only if so is $tilde{A}_lambda$ for some $lambdaneq{1over2}$. Also $A$ is self adjoint if and onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 247 شماره
صفحات -
تاریخ انتشار 2002