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

Problems with meeting people!

Yeah, I did some problems and here are a few of them! I hope you guys try them! Putnam, 2018 B3 Find all positive integers $n < 10^{100}$ for which simultaneously $n$ divides $2^n$, $n-1$ divides $2^n - 1$, and $n-2$ divides $2^n - 2$. Proof We have $$n|2^n\implies n=2^a\implies 2^a-1|2^n-1\implies a|n\implies a=2^b$$ $$\implies 2^{2^b}-2|2^{2^a}-2\implies 2^b-1|2^a-1\implies b|a\implies b=2^c.$$ Then simply bounding. USAMO 1987 Determine all solutions in non-zero integers $a$ and $b$ of the equation $$(a^2+b)(a+b^2) = (a-b)^3.$$ Proof We get $$ 2b^2+(a^2-3a)b+(a+3a^2)=0\implies b = \frac{3a-a^2\pm\sqrt{a^4-6a^3-15a^2-8a}}{4}$$ $$\implies a^4-6a^3-15a^2-8a=a(a-8)(a+1)^2\text{ a perfect square}$$ $$\implies a(a-8)=k^2\implies a^2-8a-k^2=0\implies \implies a=\frac{8\pm\sqrt{64+4k^2}}{2}=4\pm\sqrt{16+k^2}. $$ $$ 16+k^2=m^2\implies (m-k)(m+k)=16.$$ Now just bash. USAMO 1988 Suppose that the set $\{1,2,\cdots, 1998\}$ has been partitioned into disjoint pairs $\{a_i,b_i\}$ ($1...
3 comments
Read more

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

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

How to prepare for RMO?

"Let's wait for this exam to get over".. *Proceeds to wait for 2 whole fricking years!  I always wanted to write a book recommendation list, because I have been asked so many times! But then I was always like "Let's wait for this exam to get over" and so on. Why? You see it's pretty embarrassing to write a "How to prepare for RMO/INMO" post and then proceed to "fail" i.e not qualifying.  Okay okay, you might be thinking, "Sunaina you qualified like in 10th grade itself, you will obviously qualify in 11th and 12th grade." No. It's not that easy. Plus you are talking to a very underconfident girl. I have always underestimated myself. And I think that's the worst thing one can do itself. Am I confident about myself now? Definitely not but I am learning not to self-depreciate myself little by little. Okay, I shall write more about it in the next post describing my experience in 3 different camps and 1 program.  So, I got...
7 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...
2 comments
Read more

IMO Shortlist 2022 C1

  Today we shall try IMO Shortlist $2022$ C1. A $\pm 1$-sequence is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and$$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$ We claim that the answer is $\boxed{506}$. $506$ is the upper bound. Just consider the sequence $$+1,-1,-1,+1,+1,-1,-1,+1\dots,-1,-1,+1,+1,-1.$$ Here $1, -1, -1, 1$ is repeated $505$ times and $1,-1$ is concatted to it. Now,our sequence would be $a_1,a_3,a_4,a_5,a_7,\dots$ which on summing would give $506$. And clearly, this would give the upper bound. Now, we show that $506$ is attainable by every sequence. WLOG there are at least $1011$ positive numbers in the sequence. Then we choose $+1$ whenever we can. Let the sequence be $c_1,b_1,\dots, c_n,b_n$ where $c_i$ are ...
1 comment
Read more

IMO Shortlist 2021 C1

 I am planning to do at least one ISL every day so that I do not lose my Olympiad touch (and also they are fun to think about!). Today, I tried the 2021 IMO shortlist C1.  (2021 ISL C1) Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$. Suppose not. Then any $3$ elements $x,y,z\in S$ will be $(x,y)=(y,z)=(x,z)$ or $(x,y)\ne (y,z)\ne (x,z)$. There exists an infinite set $T$ such that $\forall x,y\in T,(x,y)=d,$ where $d$ is constant. Fix a random element $a$. Note that $(x,a)|a$. So $(x,a)\le a$.Since there are infinite elements and finite many possibilities for the gcd (atmost $a$). So $\exists$ set $T$ which is infinite such that $\forall b_1,b_2\in T$ $$(a,b_1)=(a,b_2)=d.$$ Note that if $(b_1,b_2)\ne d$ then we get a contradiction as we get a set satisfying the proble...
1 comment
Read more

INMO Scores and Results

Heya! INMO Results are out! Well, I am now a 3 times IMOTCer :D. Very excited to meet every one of you! My INMO score was exactly 26 with a distribution of 17|0|0|0|0|9, which was a fair grading cause after problem 1, I tried problem 6 next. I was hoping for some partials in problem 4 but didn't get any.  I am so so so excited to meet everyone! Can't believe my olympiad journey is going to end soon..  I thought to continue the improvement table I made last year! ( I would still have to add my EGMO performance and also IMO TST performance too) 2018-2019[ grade 8]:  Cleared PRMO, Cleared RMO[ State rank 4], Wrote INMO 2019-2020[ grade 9]:  Cleared PRMO, Cleared RMO[ State topper], Wrote INMO ( but flopped it) 2020-2021[grade 10]:  Cleared IOQM, Cleared INMO [ Through Girl's Quota] 2021-2022[grade 11]:  Wrote EGMO 2022 TST[ Rank 8], Qualified for IOQM part B directly, Cleared IOQM-B ( i.e INMO) [Through general quota],  2022-2023 [grade 12]:  Wrote E...
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

Symmetric Polynomials #week 6

Well... I haven't seen much symmetric polynomials in Olympiads, but still I am learning, because I found them cute. And I am basically using this blog as my notes :P What are symmetric polynomials?  One can understand this with  examples. If we are considering over 3 variables, $x_1,x_2,x_3$ then  $$\sum_{sym}x_1^2\cdot x_2^3\cdot x_3=x_1^2\cdot x_2^3\cdot x_3+x_1^2\cdot x_3^3\cdot x_2+x_2^2\cdot x_1^3\cdot x_3+x_2^2\cdot x_3^3\cdot x_1+x_3^2\cdot x_1^3\cdot x_2.$$ See? $3!$ terms! Let's take one more example with again over 3 variables, $x_1,x_2,x_3$ then $$\sum_{sym}x_1^2\cdot x_2^2= x_1^2\cdot x_2^2+x_1^2\cdot x_3^2+x_2^2\cdot x_1^2+x_2^2\cdot x_3^2+x_3^2\cdot x_1^2+x_3^2\cdot x_2^2$$ Wait.. why 2 times ? So basically what happens in symmetrictric sums, is we go through all $n!$ possible permutations. So, here we have $a^2\cdot b^2\cdot c^0$ as like the "general" form type, right? Now, list down all the $3!=6$ permutations of $x_1,x_2,x_3$, and put them in the gene...
3 comments
Read more