On open orbits and their complements
نویسندگان
چکیده
منابع مشابه
turkish-israeli relations and their implication on iranian national security
this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...
15 صفحه اولin translation: translators on their work and what it means
کتاب در باب ترجمه، اثر استر آلن و سوزان برنوفسکی منتشر شده در ماه می 2013 توسط نشریه کلمبیا است. نویسندگان در این کتاب به بررسی 18 مترجم با در نظر گرفتن نقش آثاری که این مترجمان ترجمه کرده اند میپردازند. کتاب به دو بخش تقسیم میشود: " مترجم در جهان" و " کار مترجم" این دو بخش مقالات همیشگی ترجمه و موقعیت خاص ادبیات بیگانه در جهان وسیع امروزی را مورد خطاب قرار میدهد. در این کتاب مقالات متعددی از ن...
An Open Problem on k-Defective Colourings of Triangle-free Graphs and their Complements
A graph G is (m,k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced on vertices receiving the same colour is at most k. The k-defective chromatic number χk(G) is the least positive integer m for which G is (m,k)colourable. Maddox proved that χk(G)+χk(Ḡ) ≤ 5 p 3k+4 whenever G is a triangle-free of order p and k ≥ 0 is an integer. Sima...
متن کاملON THE STRUCTURE OF FINITE PSEUDO- COMPLEMENTS OF QUADRILATERALS AND THEIR EMBEDDABILITY
A pseudo-complement of a quadrilateral D of order n, n, > 3, is a non-trivial (n+l)- regular linear space with n - 3n + 3 points and n + n - 3 lines. We prove that if n > 18 and D has at least one line of size n - 1, or if n > 25 , then the set of lines of D consists of three lines of size n -1, 6(n - 2) lines of size n - 2, and n - 5n + 6 lines of size n - 3. Furthermore, if n > 21 and D...
متن کاملExcluding hooks and their complements
The celebrated Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there exists ε(H) > 0 such that every graph G that does not contain H as an induced subgraph contains a clique or an independent set of size at least n. A weaker version of the conjecture states that the polynomial-size clique/independent set phenomenon occurs if one excludes both H and its complement H. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1990
ISSN: 0021-8693
DOI: 10.1016/0021-8693(90)90089-7