Graph Theory: Planar Graphs

Continuing from the previous post ( which is here ). This is a bit short post. I think this 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 H:

Planar Graphs: A planar graph is a graph that can be represented by a diagram with no edge cross. Such a diagram is called a plane diagram. For $K_4$ is a planar graph.
Regions formed by a graph: The planar graph divides the plan into regions
Non- planar graph: A non-planar graph is a graph that always has a edge cross.
Regional Degrees: The regions are boundaries by edges. The number od edges each region is boundaries with is called regional degrees.
Subdivision: A graph that is obtained by inserting vertices of degree $2$ is an already existing edge.

Regional Degree theorem: Let $G$ be a connected graph and let $r_1,r_2,\dots $ be the degrees of the regions in any plane diagram of $G.$ Then the sum of $$r_1+r_2+r_3+\dots =2e$$

Proof: Note that each edges contributes two times in the region sum, since it's part of two regions. ( True for multi graph too)

Funfact: Let $G$ be a connected graph with three or more vertices. Then in any plane of diagrams of $G,$ every region has degree greater than or equal to $3.$

Regions and each edge contribute to two

Euler's Formula: Let $G$ be a connected planar graph with $v$ vertices and $e$ edges and $r$ be the number of regions in any plane diagram $G.$ Then $$v-e+r=2.$$

More on Euler's formula: We can extend it to solid to reknown formula $$v-e+f=2.$$

Proof: We consider a spanning tree of the connected graph. It exist as the graph is connected. Note that now we have $$v-e+r= v-(v-1)+1=2.$$

Now, whenever we add an edge, we get a new cycle and hence a new region. So the $-e+r$ is constant.

Another proof: Reduce the graph into spanning tree by removing one edge from a cycle and same reasoning.

Problem 1: Prove that $K_5$ is non planar.

Proof: Suppose it is planar, then since $K_5$ is connected, it must satisfy the Euler's formula. So $$v-e+r=2\implies r= 7$$

But by the funfact, the regional degree sums must be $\ge 7\cdot 3=21$ but regional degree sum is $2e=20.$ Contradiction.

Problem 2: Let $G$ be a connected graph with three or more vertices. Show that $r\le 2e/3$ and prove that $e\le 3v-6.$

Proof: For the first inequality we use the fact that each region is bondried by atleats $3$ edges. And $$2e=\sum r_i, r_i\ge 3 \implies r\le 2e/3.$$ Using euler's formula, we get $$ v-e+r=2\implies v-e+2e/3\ge 2\implies 3v-6 \ge e$$

Problem 3: In any plane diagram of a bipartite graph, all of the regional degrees must be even.

Proof: Consider the boundaries of any region. Since it is a bipartite graph, colour the vertices with two colour such that no two adjacent vertices are of the same colour. So the boundaries must have even length i.e even degree.

Problem 4: Suppose $G$ is bipartite Show that $r\le e/2$ and $e\le 2v-4.$

Prooof: Since $G$ is bipartite, the regional degree must be at least $4$ so $$r\le \frac{2e}{4}=\frac{e}{2}.$$

Using Euler's Formula, we get $$ v-e+r=2\implies v-e +\frac{e}{2}\ge 2\implies 2v-e\ge 4$$

So $$e\le 2v-4.$$

Problem 5: Prove that $K_{3,3}$ is non planar.

Proof: Suppose it is planar, then since $K_{3,3}$ is connected, it must satisfy the Euler's formula.

By euler's formula, we get $$v-e+r=2\implies r= 5.$$ Since, we have bipartite graph, we get $r\le e/2 $ but $5\ge 9/2.$

Non planar graphs [intuitive idea]:

When we add a degree two vertex to a non plannar graph $G$, the new subdivision graph $G'$ would be non plannar. In order to make $G$ a planar graph, we would have to add vertex in the "intersection" of the edges, which have degree $4.$

Moreover, if the subdivision $G'$ of the graph $G$ is planar then $G$ is planar too. The only case it wont be planar is when we remove the vertex from $G'$ which forms the intersection point. But then this vertex would have degree $4$ at least. Hence it is not the point we added so form the subdivision.

Hence, if one graph is a subdivision of another, then either both graphs are planar or else both are non planar.

Subdivision of $K_5$

Problem: If a graph $G$ contains a subgraph with is either $K_{3,3}$ or $K_5$ or a subdivision of one of these, then $G$ must be non -planar.

This just works, because we know the subdivision would be non planar.

Now, here's the black magic! I don't know the proof of this theorem though..

Kuratowski's Theorem: Every non planar contains a subgraph which is either $K_5$ or $K_{3,3}.$

Using this theorem, we can show that a Petersen graph non planar too.

The Petersen graph is non planar

Problem: Show that the Petersen graph is non-planar

Proof: Refer to the below image

We use the subdivision fact and the fact that $K_{3,3}$ is non-planar. By Kuratowski's Theorem we are done.

Yayy!! That's it for this blog post, I think there will be a sequel talking about vertex colouring which I am so excited to learn!

Sunaina💜

Comments

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....

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$ ...

Just spam combo problems cause why not

This post is mainly for Rohan Bhaiya. He gave me/EGMO contestants a lot and lots of problems. Here are solutions to a very few of them. To Rohan Bhaiya: I just wrote the sketch/proofs here cause why not :P. I did a few more extra problems so yeah. I sort of sorted the problems into different sub-areas, but it's just better to try all of them! I did try some more combo problems outside this but I tried them in my tablet and worked there itself. So latexing was tough. Algorithms "Just find the algorithm" they said and they died. References: Algorithms Pset by Abhay Bestrapalli Algorithms by Cody Johnson Problem1: Suppose the positive integer $n$ is odd. First Al writes the numbers $1, 2,\dots, 2n$ on the blackboard. Then he picks any two numbers $a, b$ erases them, and writes, instead, $|a - b|$. Prove that an odd number will remain at the end. Proof: Well, we go $\mod 2$. Note that $$|a-b|\equiv a+b\mod 2\implies \text{ the final number is }1+2+\dots ...

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...

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...

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...

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...

Challenging myself? [Jan 15-Jan 27]

Ehh INMO was trash. I think I will get 17/0/0/0-1/3-5/10-14, which is def not good enough for qualifying from 12th grade. Well, I really feel sad but let's not talk about it and focus on EGMO rather. INMO 2023 P1 Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square. I will use Atul's sol, cause it's the exact same as mine. Proof: Consider the graph $G$ induced by the elements of $S$ and edges being if the products are perfect squares. Note that if $xy = a^2$ and $xz = b^2$, then $yz = \left( \frac{ab}{x} \right)^2$, since its an integer and square of a rational number its a perfect square and so $yz$ is an edge too. So the graph is a bunch of disjoint cliques, say with sizes $c_1, c_2, \cdots, c_k$. Then $\sum_{i=1}^k c_i^2 = 2023$, which ...

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 ...

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...

Sunaina thinks absurd

Search This Blog