Class notes
complement & simple graph with n-vertices & Ramsey Theory & Ramsey number & Graphs with no triangles & Turan’s Theorem &
- Course
- Institution
This is the beast curse for student
[Show more]
Seller
Follow
bilal-guma
Content preview
Department of Mathematics Elementary Graph Theory Lecture 5 The complement G′ of G is defined as a simple graph with the same vertex set
as G and two vertices u and v are adjacent only when they are not adjacent in
G.
A graph G is called self-complementary graph if it is isomorphic to its
complement
Problem: If a simple graph with n-vertices is isomorphic with its complement, how
many vertices will that have ?
Solution: Let q be the number of edges of G and q be the number of edges in the
complement G , then
p( p 1)
q q
2
If G is a self-complementary graph, then q q
p( p 1) p( p 1)
2q q
2 4
Hence, in a self-complementary graph p or p 1 must be divisible by 4.
** from the above problem we get that, there exist no self-complementary graph of
order 2, 3, 6, 7, 10, 11, …
Dr. Didar A. Ali 1
, Department of Mathematics Elementary Graph Theory Lecture 5
Ramsey Theory
Theorem: For any graph G with six vertices, G or G contains a triangle.
(Given a group of six people we can always find either three who all know
each other or three who don’t know each other)
Proof: Let v be any vertex of a graph G with six vertices. Since v is adjacent either
in G or in G to the other five vertices of G.
Assume that, without loss of generality v is adjacent to three vertices u1, u2, u3 in G.
If any two of these vertices of u1, u2 and u3 are adjacent in G, then they are two
vertices of a triangle whose third vertex is v.
If no two of them are adjacent in G, then u1, u2 and u3 are the vertices of a
triangle in G .
Ramsey number
Ramsey number R(m, n) is the smallest integer number, such that every graph
of order R(m, n) contains a subgraph K m or K n .
Dr. Didar A. Ali 2
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller bilal-guma. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $2.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
52928 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now