Skip to main content

Graph Theory: Independent sets and My blog feactured in feedSpost!!!

Continuing from the previous post ( which is here ). This is a bit short post. I think this short post is not at all helpful in olys but then let's do it cause I find them interesting :P. Here are my notes..


Book referred: Daniel A Marcus Graph theory

Chapter I:

Independence Sets:

  • Independent vertex set: An independent vertex set in a graph is a set of vertices that does not include any adjacent vertices.

  • Independent edge set: An independent edge set in a graph is a set of edges that does not include any edges that share an endpoint.

  • Maximal Independent sets: Largest set possible.

  • $\alpha =$ the number of vertices in a maximal independent set
  • $\alpha ' =$ the number of edges in a maximal independent edge set
Theorem1: In a graph with $n$ vertices and $e$ edges,
a) $\alpha'$ is less than $n/2$
b) if $d_1,d_2,\dots $ be the degress in a maximal independent vertex set, then the sum $d_1+d_2+\dots $ is less than $e.$

Proof: Note that every edge will have distinct vertex endpoints and no two edge share the same. So $|\alpha'|\le n/2.$ 

Let $\{v_1,v_2,\dots, v_{\alpha}\}$ denote the maximal independent set. Note that there is no $a$ in the set such that $v_i$ and $a$ are connected.
Now, note that sum of degrees is always $2e$ where $2$ is there cause each edge give $2$ to the sum. But since  there is no edge, we get $d_1+d_2+\dots \le e$

Corollary: In any $d-$ regular graph with $n$ vertices and $d\ge 1,$ $\alpha $ is less than or equal to  $n/2.$

Proof: Note that the number of edges is $n\cdot d$ and we know that $$d_1+d_2+\dots +d_{\alpha} \le e=\frac{ dn}{2}\text{ but each have degree } d \implies \alpha \le \frac{n}{2}.$$ 

Theorem2: In any graph with $n$ vertices, $\alpha +\alpha'$ is always less than or equal to $n.$

Proof: Let $S$ be a maximal independent vertex set and let $S'$ be the maximal independent edge set. 
Note that $S$ contains $\alpha$ vertices and the $S'$ will have $\alpha'$ vertices. 

So the vertices in $S'$ are $2\alpha.$ But for atleast $\alpha$ vertices are not in $S.$

Hence $\alpha+\alpha'\le n$

A nice question would be is "when is the equality"? Turns out our favourite Bipartite graphs satisfy!

Theorem3: For bipartite graph with $n$ vertices, $\alpha+\alpha'=n$

The proof is beyond my knowledge :pleading:

Corollary: In any $d$ regular bipartite graph with $n$ vertices and $d\ge 1,\alpha=\alpha'=n/2.$

Proof: We know that $\alpha' \le \frac{n}{2}$ and $$d_1+d_2+\dots +d_{\alpha}\le \frac{nd}{2}\implies \alpha\le \frac{n}{2}$$ 

Hence $$\alpha=\alpha'=n/2.$$

Coversing Sets: 

  • Covering vertex set: A covering vertex set in a graph is a set of edges such that any edge has atleast one endpoint.

  • Covering edge set: A covering edge set in a graph is a set of edges such that any vertex is endpoint of atleast one edge.

  • Minimal Covering sets: smallest set possible.

  • $\beta  =$ the number of vertices in a minimal vertex set
  • $\beta ' =$ the number of edges in a minimal vertex edge set

Now, a very curious guess would be if $\alpha+\beta =n?$ Which is true by the collorary!

Theorem1: In any graph $G$, let $S$ be a maximal independent vertex set. Then a minimal covering vertex set can be obtained by taking all vertices are not in $S.$


Proof: Let $S=\{v_1,v_2\dots, v_{\alpha}\}$ be the maximal independent vertex set. Consider the complement of $S=\{a_1,a_2,\dots,a_n\}$ ( say $S^c$) we get that for every $e\in V$ we get that $e $  has atleast one endpoint in $S^c$ ( because $S$ is independent ). Hence $S^c$ is a covering set.

Now, to show the minimality, consider the minimal covering set $X.$ We are assuming ( for contradiction) that $|X|\le |S^c|.$ Then, consider the complement of $X.$ The complement will also be an independent set. But the independent set's cardinality is $>|S|.$ Contradiction.

Hence a minimal covering vertex set can be obtained by taking all vertices are not in $S.$


Corollary: In any graph with $n$ vertices, $\alpha+\beta =n$

Next theorem was very hard to prove and the idea was very non trivial.

Theorem2: In any graph with minimum degree $\delta\ge 1,$ let $S'$ be a maximal independent edge set. Then a minimal covering edge set can be obtained in the following way: Start by including all the edges in $S'.$ Then, for each vertex that is not covered by $S',$ select any one edge at that vertex and include that edge.

Proof: We know that the set is a covering edge set ( say $C$) as every vertex is being include. We start with the claim.

Claim: $C$ has $n-\alpha'$ edges.
Proof: It's just $\alpha' +(n-2\alpha')$ where the second term follows are the number of vertices which arent included in $S'.$

Let $C'$ be any minimal covering edge set and $H$ the subgraph containg all vertices and the edges from $C'$ only. Then $C'$ is the minimal covering edge set of $H.$ And hence $$|C'|=n-\alpha'(H)\ge n-\alpha'$$ where  $\alpha'(H)$ is maximal independece number.
 
And we are done!

Hence we get $\alpha'+\beta=\alpha'+(n-\alpha') =n.$

Yeah that's it for today's post! Also, my blog is featured in FeedSpot's Top 10 Geometry Blogs and Website!! And it is ranked $4$!! I am so happy and I have literally no words T_T.. Really very grateful to FeedSpot! Also thankyou to everyone who reads the blog! 

Hi Sunaina,

My name is Anuj Agarwal, I'm the Founder of Feedspot.

I would like to personally congratulate you as your blog Sunaina thinks absurd has been selected by our panelist as one of the Top 10 Geometry Blogs on the web.

https://blog.feedspot.com/geometry_blogs/

I personally give you a high-five and want to thank you for your contribution to this world. This is the most comprehensive list of Top 10 Geometry Blogs on the internet and I'm honored to have you as part of this!

We'd be grateful if you can help us spread the word by briefly mentioning about the Top 10 Geometry Blogs list in any of your upcoming post.

Please let me know.

Best,
Anuj



Hopeyou enjoyed the blogpost! 
See you soon
Sunaina 💜




Comments

  1. Swastika DebJanuary 13, 2022 at 4:28 PM

    Woahhh great work!!!! Also congrats for getting a rank 4 for the blog 🤩 🥳🥳

    ReplyDelete
  2. AntareepJanuary 15, 2022 at 8:28 PM

    Woah congrats!!Love geo live geo and reap geo(idk if this has any meaning)

    ReplyDelete

Post a Comment

Popular posts from this blog

My experiences at EGMO, IMOTC and PROMYS experience

Yes, I know. This post should have been posted like 2 months ago. Okay okay, sorry. But yeah, I was just waiting for everything to be over and I was lazy. ( sorry ) You know, the transitioning period from high school to college is very weird. I will join CMI( Chennai Mathematical  Institue) for bsc maths and cs degree. And I am very scared. Like very very scared. No, not about making new friends and all. I don't care about that part because I know a decent amount of CMI people already.  What I am scared of is whether I will be able to handle the coursework and get good grades T_T Anyways, here's my EGMO PDC, EGMO, IMOTC and PROMYS experience. Yes, a lot of stuff. My EGMO experience is a lot and I wrote a lot of details, IMOTC and PROMYS is just a few paras. Oh to those, who don't know me or are reading for the first time. I am Sunaina Pati. I was IND2 at EGMO 2023 which was held in Slovenia. I was also invited to the IMOTC or International Mathematical Olympiad Training Cam...
11 comments
Read more

Geometry ( Finally!!!)

 This is just such an unfair blog.  Like if one goes through this blog, one can notice how dominated  Algebra is!! Like 6 out of 9 blog post is Algebra dominated -_- Where as I am not a fan of Algebra, compared to other genres of Olympiad Math(as of now). And this was just injustice for Synthetic Geo. So this time , go geo!!!!!!!!!!!  These problems are randomly from A Beautiful Journey through Olympiad Geometry.  Also perhaps I will post geo after March, because I am studying combi.  Problem:  Let $ABC$ be an acute triangle where $\angle BAC = 60^{\circ}$. Prove that if the Euler’s line of $\triangle ABC$ intersects $AB$ and $AC$ at $D$ and $E$, respectively, then $\triangle ADE$ is equilateral. Solution:  Since $\angle A=60^{\circ}$ , we get $AH=2R\cos A=R=AO$. So $\angle EHA=\angle DOA.$ Also it's well known that $H$ and $O $ isogonal conjugates.$\angle OAD =\angle EAH.$ By $ASA$ congruence, we get $AE=AD.$ Hence $\triangle ADE$ is equilateral....
3 comments
Read more

Introduction

  Hey Everyone!! This is my first Blog post. So let me give a brief introduction about myself. I am Sunaina Pati. I love solving Olympiad math problems,  learning crazy astronomical facts , playing hanabi and anti-chess, listening to Kpop , love making diagrams in Geogebra and  teaching other people maths 😊 . I love geometry , number theory and Combinatorics . I am starting this blog to keep myself a bit motivated in doing studies 😎 . Right now, I am planning to write walkthroughs on some of the best problems I tried over the week which can refer for hints 'cause solutions contain some major spoilers and one learns a lot while solving the problem on his own rather than seeing solutions . Also, there will be some reviews about Kpop songs, study techniques, my day to day lifestyles,exam reviews and ofc some non-sense surprises 😂.  I am planning to  try  posting every week on Sundays or Saturdays ( most probably) ! Though there is no guarantee about when I ...
20 comments
Read more

Some problems in Olympiad Graph theory!

Hello there! It has been a long time since I uploaded a post here. I recently took a class at the European Girls' Mathematical Olympiad Training Camp 2024, held at CMI. Here are a few problems that I discussed! My main references were Po-Shen Loh's Graph theory Problem set (2008), Adrian tang's Graph theory problem set (2012) and Warut Suksompong's Graph Cycles and Olympiad Problems Handout and AoPS. I also referred to Evan Chen's Graph theory Otis Problem set for nice problems! Text Book Problems which are decent A connected graph $G$ is said to be $k$-vertex-connected (or $k$-connected) if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are removed. Show that every $k$-connected graph of order atleast $2k$ contains a cycle of length at least $2k$. We begin with a lemma. Prove that a graph $G$ of order $n \geq 2k$ is $k$ connected then every 2 disjoint set $V_1$ and $V_2$ of $k$ distinct vertices each, there exist $k$...
2 comments
Read more

Problems I did this week [Jan8-Jan14]

Yeyy!! I am being so consistent with my posts~~ Here are a few problems I did the past week and yeah INMO going to happen soon :) All the best to everyone who is writing!  I wont be trying any new problems and will simply revise stuffs :) Some problems here are hard. Try them yourself and yeah~~Solutions (with sources) are given at the end! Problems discussed in the blog post Problem1: Let $ABC$ be a triangle whose incircle $\omega$ touches sides $BC, CA, AB$ at $D,E,F$ respectively. Let $H$ be the orthocenter of $DEF$ and let altitude $DH$ intersect $\omega$ again at $P$ and $EF$ intersect $BC$ at $L$. Let the circumcircle of $BPC$ intersect $\omega$ again at $X$. Prove that points $L,D,H,X$ are concyclic. Problem 2: Let $ ABCD$ be a convex quadrangle, $ P$ the intersection of lines $ AB$ and $ CD$, $ Q$ the intersection of lines $ AD$ and $ BC$ and $ O$ the intersection of diagonals $ AC$ and $ BD$. Show that if $ \angle POQ= 90^\circ$ then $ PO$ is the bisector of $ \angle AOD$ ...
Post a Comment
Read more

Orders and Primitive roots

 Theory  We know what Fermat's little theorem states. If $p$ is a prime number, then for any integer $a$, the number $a^p − a$ is an integer multiple of $p$. In the notation of modular arithmetic, this is expressed as \[a^{p}\equiv a{\pmod {p}}.\] So, essentially, for every $(a,m)=1$, ${a}^{\phi (m)}\equiv 1 \pmod {m}$. But $\phi (m)$ isn't necessarily the smallest exponent. For example, we know $4^{12}\equiv 1\mod 13$ but so is $4^6$. So, we care about the "smallest" exponent $d$ such that $a^d\equiv 1\mod m$ given $(a,m)=1$.  Orders Given a prime $p$, the order of an integer $a$ modulo $p$, $p\nmid a$, is the smallest positive integer $d$, such that $a^d \equiv 1 \pmod p$. This is denoted $\text{ord}_p(a) = d$. If $p$ is a primes and $p\nmid a$, let $d$ be order of $a$ mod $p$. Then $a^n\equiv 1\pmod p\implies d|n$. Let $n=pd+r, r\ll d$. Which implies $a^r\equiv 1\pmod p.$ But $d$ is the smallest natural number. So $r=0$. So $d|n$. Show that $n$ divid...
7 comments
Read more

Solving Random ISLs And Sharygin Solutions! And INMO happened!!

Some of the ISLs I did before INMO :P  [2005 G3]:  Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$ Solution: Note that $$\Delta LDK \sim \Delta XBK$$ and $$\Delta ADY\sim \Delta XCY.$$ So we have $$\frac{BK}{DY}=\frac{XK}{LY}$$ and $$\frac{DY}{CY}=\frac{AD}{XC}=\frac{AY}{XY}.$$ Hence $$\frac{BK}{CY}=\frac{AD}{XC}\times \frac{XK}{LY}\implies \frac{BK}{BC}=\frac{CY}{XC}\times \frac{XK}{LY}=\frac{AB}{BC}\times \frac{XK}{LY} $$ $$\frac{AB}{LY}\times \frac{XK}{BK}=\frac{AB}{LY}\times \frac{LY}{DY}=\frac{AB}{DL}$$ $$\implies \Delta CBK\sim \Delta LDK$$ And we are done. We get that $$\angle KCL=360-(\angle ACB+\angle DKC+\angle BCK)=\angle DAB/2 +180-\angle DAB=180-\angle DAB/2$$ Motivation: I took a hint on this. I had other angles but I did...
4 comments
Read more

Let's complex bash Part 1

I have to learn complex bash. And almost everyone knows that I am notes taking girl so thought why not make a post on complex bash ( so that I don't get emotionally demotivated lol).😇 There wasn't any need for learning complex bash, but it was in my dream checklist i.e " To learn a bash." And since I am not loaded with exams, I think it's high time to learn Bash and new topics.  Also if anyone from the "anti-bash" community is reading, sorry in advance and R.I.P.  Notes:- 1. Complex numbers are of the form $z=a+ib,$ where $a$ and $b$ are real numbers and $i^2=-1.$ 2. In polar form, $z=r(\cos \theta+~~i\sin\theta)=~~re^{i\theta},$ where $r=~~|z|=~~\sqrt{a^2+b^2},$ which is called the magnitude. 3. Here we used euler's formula i.e $\cos \theta+~~i\sin\theta=~~e^{i\theta}.$ 4. The $\theta $ is called the argument of $z,$ denored $\arg z.$ ( $\theta$ can be considered in $\mod 360$ and it is  measured anti-clockwise). 5. The complex conjugate of $z$ is ...
4 comments
Read more

IMO 2023 P2

IMO 2023 P2 Well, IMO 2023 Day 1 problems are out and I thought of trying the geometry problem which was P2.  Problem: Let $ABC$ be an acute-angled triangle with $AB < AC$. Let $\Omega$ be the circumcircle of $ABC$. Let $S$ be the midpoint of the arc $CB$ of $\Omega$ containing $A$. The perpendicular from $A$ to $BC$ meets $BS$ at $D$ and meets $\Omega$ again at $E \neq A$. The line through $D$ parallel to $BC$ meets line $BE$ at $L$. Denote the circumcircle of triangle $BDL$ by $\omega$. Let $\omega$ meet $\Omega$ again at $P \neq B$. Prove that the line tangent to $\omega$ at $P$ meets line $BS$ on the internal angle bisector of $\angle BAC$. Well, here's my proof, but I would rather call this my rough work tbh. There are comments in the end! Proof Define $A'$ as the antipode of $A$. And redefine $P=A'D\cap (ABC)$. Define $L=SP\cap (PDB)$.  Claim1: $L-B-E$ collinear Proof: Note that $$\angle SCA=\angle SCB-\angle ACB=90-A/2-C.$$ So $$\angle SPA=90-A/2-C\implies \ang...
1 comment
Read more

How to prepare for INMO

Since INMO is coming up, it would be nice to write a post about it! A lot of people have been asking me for tips. To people who are visiting this site for the first time, hi! I am Sunaina Pati, an undergrad student at Chennai Mathematical Institute. I was an INMO awardee in 2021,2022,2023. I am also very grateful to be part of the India EGMO 2023 delegation. Thanks to them I got a silver medal!  I think the title of the post might be clickbait for some. What I want to convey is how I would have prepared for INMO if I were to give it again. Anyway, so here are a few tips for people! Practice, practice, practice!! I can not emphasize how important this is. This is the only way you can realise which areas ( that is combinatorics, geometry, number theory, algebra) are your strength and where you need to work on. Try the problems as much as you want, and make sure you use all the ideas you can possibly think of before looking at a hint. So rather than fixing time as a measure to dec...
9 comments
Read more