/Resources << I've been that way since I've been out here. A Relation to Line Graphs: A digraph G is Eulerian L(G) is hamiltonian. /Im19 313 0 R 667 667 667 278 278 278 278 722 722 778 When it comes down to it, I don't really care what you think. I don't care if you think that was the wrong decision. [Laughs] Everyone but Trish. endobj More Survivor: Cagayan exit interviews: She also discusses her post-Survivor plans. Clearly, an eulerian graph must be connected. /Type /Pages Solana subsequently won two straight challenges, which as either a fluke or addition by subtraction. The key to performance in a DBMS is to reduce the number of disk reads, and that is accomplished by increasing the number of positive hits on the c /Font << << One possible Hamiltonian path is the sequence of vertices (1, 6, 2, 7, 3, 8, 4, 9, 5, 10). /Thumb 136 0 R There's people who you don't like. /Rotate 0 I think they got it set up. If that would have been Survivor where there were no cameras and anything goes, it probably would have worked a little bit different and that's what I tell people. I don't like her and she's mean to everybody, but that's not me at all. I really want to just calm down, but I knew that as soon as I saw her, it would be right back at it. endobj 34 0 obj >> /MediaBox [0 0 418 643] I sent in a video behind his back! WebWe know the Petersen graph has 15 edges and 10 vertices. Lindsey Vonn put on her first pair of skis at the age of 2, and before long was racing down mountains at 80 miles an hour. endobj So I have watched ungodly amounts of Survivor in the past year. One thing you probably noticed in running this second block of code is that it tended to come back much faster than the first. We now show a drawing of the Petersen graph. We were getting fewer and fewer. >> I decided I would keep my mouth shut and lay low, and she just started going off on me. endobj << We also use third-party cookies that help us analyze and understand how you use this website. Lindsey Ogle, age 26, Bloomington, IN 47401 View Full Report. A graph is an Eulerian if and only if it is connected and degree of every. >> It will execute until it finds a graph \(\textbf{G}\) that is eulerian. endobj You draw it by starting at a vertex of odd degree (or anywhere in case there are none.) /Contents [274 0 R 275 0 R 276 0 R 277 0 R 278 0 R 279 0 R 280 0 R 281 0 R 282 0 R 283 0 R Also, each Ki has strictly less than /BaseFont /Helvetica-Bold A clique of a graph G is a subset S of its nodes such that the subgraph corresponding to it is complete. Lindsey: I don't know! If I do this, this is probably gonna be the repercussions. And I'm really glad they didn't show everything. At the top, click Responses. Before proceeding to Euler's elegant characterization of eulerian graphs, let's use SageMath to generate some graphs that are and are not eulerian. /Rotate 0 /Type /Page 3 How combinatory and graph theory are related each other? >> /Parent 2 0 R /MediaBox [0 0 417 642] What if a graph is not connected? And a lot of people are like, You're blaming it on your daughter. I guarantee the surprise! WebAny 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph. /CropBox [0 6.48 414.48 647] We launch our algorithm with a trivial circuit \(C\) consisting of the vertex \(x_0=(1)\). /F0 28 0 R 31 0 obj << All the people who are like, Lindsey, I cannot believe that you did not punch her teeth out And I'm like, You know. It would have been like playing against the Little Rascals with Cliff. /Font << Exactly zero or two vertices have odd degree, and. /MediaBox [0 0 415 641] Here is the sequence of circuits starting with the trivial circuit \(C\) consisting only of the vertex 1. 2 What is the chromatic number of the given graph? Run the code below. /Type /Catalog /ProcSet [/PDF /Text /ImageB] Now let's try to find a graph \(\textbf{H}\) that is not eulerian. In fact, we can find it in O(V+E) time. (A2A) I'm not familiar with this subject, but I looked up "neighborhood graph" and it referred me to Lovasz's paper "Kneser's Conjecture, Chromatic endstream >> /Parent 7 0 R >> /Filter /FlateDecode If you are finding it hard to stop smoking, QuitNow! ), A graph \(\textbf{G}= (V,E)\) is said to be hamiltonian if there exists a sequence \((x_1,x_2,,x_n)\) so that. Continuous twists surprise the player. /im4 298 0 R >> If it seems to be running a log time, it may be that you have made the number of edges too small, so try increasing it a bit. Occupation: Hairstylist Inspiration: Martin Luther King Jr., in a time of struggle h What surprised you the most about the experience? /ModDate (D:20031129110512+08'00') 3 0 obj Lindsey: I don't think that had anything to with it at all. /Encoding /WinAnsiEncoding /Rotate 0 Its addictive. Definition: Graph is a mathematical representation of a network and it describes the relationship between lines and points. The Petersen graph has a Hamiltonian path but no Hamiltonian cycle. /Parent 7 0 R << >> /im8 302 0 R 6 0 obj /Parent 2 0 R I was worried that I would get into a physical confrontation with her, says Ogle, 29. Message. 180 0 R 181 0 R 182 0 R 183 0 R 184 0 R 185 0 R 186 0 R 187 0 R 188 0 R 189 0 R] J'Tia Taylor And you totally quit! And let me tell you, for the record, never would I have ever quit if it was just solely on me. /Font << Other uncategorized cookies are those that are being analyzed and have not been classified into a category as yet. /Kids [18 0 R 19 0 R 20 0 R 21 0 R 22 0 R] And Cliff was a very nice guy. Review. Am I upset that some insignificant person got me to that point? Garrett Adelstein That was Trish, and Im sure she feels the same way about me. /ProcSet [/PDF /Text /ImageB] /Font << Lindsey Ogle/Gallery < Lindsey Ogle. A graph is called Eulerian if it has an Eulerian Cycle and called Semi-Eulerian if it has an Eulerian Path. But I think that Trish had a little camera courage and I was trying to dig it, but I still think that I was a little bit in shock with Cliff. endobj WebFigure 4.3.10. Theorem 3.1 (Euler) A connected graph G is an Euler graph if and only if all vertices of G are of even degree. /Parent 6 0 R That would suggest that the non-eulerian graphs outnumber the eulerian graphs. It is said that the citizens of Knigsberg often wondered if it was possible for one to leave his home, walk through the city in such a way that he crossed each bridge precisely one time, and end up at home again. I'm like, You need to back away from me and give me a minute. It's like when you're on the playground, you know, one of those who beats up a little kid when they just got their ass beat by somebody else and she's kicking them in the face like, Yeah! /Contents [117 0 R 118 0 R 119 0 R 120 0 R 121 0 R 122 0 R 123 0 R 124 0 R 125 0 R 126 0 R 31 . /Resources << Such is the case A graph is Eulerian if every vertex has even degree. What do you mean by chromatic number and chromatic polynomial of a graph? I'm not trying to kick an old lady's ass on national TV. If you don't want to, that's fine too. So she watched it and she's like. Was quitting on your mind? Everyone but Trish. The Petersen Graph So who did you like out there?Pretty much everyone else. /ProcSet [/PDF /Text /ImageB] 13 0 obj 213 0 R 214 0 R 215 0 R 216 0 R 217 0 R 218 0 R 219 0 R 220 0 R 221 0 R 222 0 R] This result is obtained by applying The contradiction completes the proof. Does putting water in a smoothie count as water intake? 32 0 obj /Length 753 It's different to see it when you've just eaten a whole bowl of pasta and you're like, I can't believe that. Like, I'm gonna stay on my pillow in my warm bed and think about what a wimp this girl is. Copyright 2023 Elsevier B.V. or its licensors or contributors. /Font << << /Resources << Ex.3 (Petersen graph) See Figure 2. /XObject 55 0 R Give me a second. By continuing you agree to the use of cookies. WebEulers equation relating the number of vertices V, edges E and faces F of a connected planar graph is V E + F = 2. vQ$t]h-$%8[gz [~gI2@_/-!8a1ncam n 16 0 obj Word Coach is an easy and fun way to learn new words. /Producer (Acrobat 4.0 Import Plug-in for Windows ) I will be co-hosting the morning show at our sister station, WCIC in Peoria, IL, my hometown. /Type /Page It is interesting to note that she is one of the few contestants who has a job that doesnt exactly scream brawn (like police-officer), she is a hair-stylist. Or was it just getting away from them? In Petersen, that would be 10+F-15 = 2, so it would have 7 faces in it's planar embedding. /ProcSet [/PDF /Text /ImageB] << Various levels of in-game misery caused Janu, Kathy, NaOnka and Purple Kelly to quit. /Font << On the occasion of the 303 anniversary of the birth of Leonhard Euler, father of graph theory, we start publishing this week in this blog. /XObject 263 0 R . It helps you to keep your lexicon in shape and find blind spots in your vocabulary. I quit. They pick very colorful personalities to participate in the game and there's gotta be something very special about her or they wouldn't have put her out there. Sure, I guess. >> /Kids [23 0 R 24 0 R 25 0 R 26 0 R 27 0 R] Petersen graphs are a type of graph that are often used to explore patterns in data. We say that \(\textbf{G}\) is eulerian provided that there is a sequence \((x_0,x_1,x_2,,x_t)\) of vertices from \(\textbf{G}\), with repetition allowed, so that. However, this implies that, \(C = (x_1,x_2,x_3,,x_i,x_t,x_{t-1},x_{t-2},,x_{i+1})\). /Thumb 105 0 R We now describe a deterministic process that will either (a) find an eulerian circuit, (b) show that the graph is disconnected, or (c) find a vertex of odd degree. Proof Necessity Let G(V, E) be an Euler graph. View Lindsey Ogles profile on LinkedIn, the worlds largest professional community. /Thumb 158 0 R /Subtype /TrueType So we are left to consider the case where \(u_0 = u_s = x_i\). /Resources << Do you know how many thousands of people would die to get in your spot? The bipartite double graph of the Petersen graph is the Desargues graph.Petersen Graph. There is a little bit of vinegar left in my feelings for Trish, but I'm sure she's a cool person outside of the game. endstream It is thus natural to study the relationship between permutation graphs, in particular, cycle permutation graphs, and the generalized Petersen graphs first introduced by Watkins 111]. /Font << /Thumb 95 0 R /F3 30 0 R /Type /Page I'm kidding! I don't know. 1 0 obj Eulerian Path and Circuit for a Directed Graphs. What a bully. You don't want to put that on your child. /Thumb 115 0 R When \(\textbf{G}\) is eulerian, a sequence satisfying these three conditions is called an eulerian circuit. GByR`f'lIBE{I{L"8!/nHb,Dh c"p1r8V( ;2LOR73(9oWVg,WFe HCV#xO5Ne|M=651c.F;R&F` Performance cookies are used to understand and analyze the key performance indexes of the website which helps in delivering a better user experience for the visitors. /ProcSet [/PDF /Text /ImageB] WebAnswer (1 of 2): I cant guess what you mean by Eulers Theory. But I got along with all of them. >> /Subtype /Type1 The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. >> 556 556 556 333 500 278 556 500 722 500 >> >> Then there is an Eulerian subgraph in G containing S. When G is a cubic graph, G 0G and every Eulerian subgraph H of G is a cycle of G. Answer 9 RELATED: Stephen Fishbachs Survivor Blog: Is Honesty the Best Policy? Throughout this text, we will encounter a number of them. /Rotate 0 /ProcSet [/PDF /Text /ImageB] Occupation: Hairstylist Personal Claim to Fame: Rising above all obstacles with a smile, by myself. WebIs the Petersen graph in Figure 8.28 Eulerian? /MediaBox [0 0 416 641] Strong. What was the teachable moment? 778 722 278 500 667 556 833 722 778 667 Keep it moving. However, there are a number of interesting conditions which are sufficient. Euler proved the necessity part and the sufciency part was proved by Hierholzer [115]. for each \(i = 1,2,,n-1,x_ix_{i+1}\) is an edge in \(\textbf{G}\). People change. /Font << Quantic Dream really made a great effort but unfortunately did not avoid some flaws, but more on that later. >> endobj >> /XObject 65 0 R 2,628 likes. The problem is same as following question. So just because of that I do get a pre-merge boot vibe from Lindsey. Lindsey Ogle NP-C is a female family nurse practitioner in Chicago, IL. 8}TrQ?UQdr@0Eu&D~]GLv.|lYT-[}?fP-- l Lindsey Ogle is an amazing hairstylist from Kokomo, IN chosen to be on season 28 of Survivor, Cagayan. 0 Profile Searches. 8 Prove that the Petersen graph (below) is not planar. endobj I started sweating. Fleurys Algorithm to print a Eulerian Path or Circuit? endobj /Contents [66 0 R 67 0 R 68 0 R 69 0 R 70 0 R 71 0 R 72 0 R 73 0 R 74 0 R] /Parent 7 0 R I have all these things that I want to do to help. She doesn't deserve it and I'm not gonna go there. I think that we kinda agreed on the sand that night that, Maybe you're good. I told him, It's not because I'm cold, wet and hungry. Sched.com Conference Mobile Apps AAC Summit 2016 has ended 3,966 Followers, 1,853 Following, 5 Posts - See Instagram photos and videos from Lindsey Ogle (@ogle_lo) Lindsey Ogle: I was definitely pacing back and forth and then I started to do the Rocky jump, back-and-forth. I cant guess what you mean by Eulers Theory. Eulers interaction with graph theory was his solution of the Bridges of Knigsberg problem, which Answer the following questions related to Petersen graph. So why should you quit? is made for you. /Type /Page I liked Tony. She got right in my face and started rubbing my face in it. Furthermore, each edge incident with \(x\) either exits from \(x\) or enters \(x\). /ProcSet [/PDF /Text /ImageB] >> /F0 28 0 R Search the world's information, including webpages, images, videos and more. Find local businesses, view maps and get driving directions in Google Maps. /D [8 0 R /FitH -32768] << Edit Profile. /Thumb 64 0 R It does not store any personal data. And I'm like, Just back off! >> /Font << Webnon-Hamiltonian cubic generalized Petersen graphs other than those found by Robertson. WebThe Petersen graph is an obstruction to many properties in graph theory, and often is, or is conjectured to be, the only obstruction. /F0 28 0 R That is, it is a unit distance graph.. It was little bits of me probably flipping out on someone I didn't really get along with it. Copyright 1992 Published by Elsevier B.V. /F0 28 0 R /CropBox [0 0 414.56 641] Find the perfect Lindsey Ogle stock photos and editorial news pictures from Getty Images. The following elementary theorem completely characterizes eulerian graphs. /CropBox [1.44 0 416 641] So Im proud of the decision I made. /CropBox [1.44 0 416 641] /Rotate 0 /CropBox [0 1.44 414.84 642] It happened again on the most recent episode of Survivor: Cagayan, when Lindsey Ogle became the most recent contestant to quit the game. /Resources << Lindsey has 3 jobs listed on their profile. 333 389 584 278 333 278 278 556 556 556 Problem 2 What is the minimum number of trails needed to decompose the Petersen graph? endobj /Rotate 0 The Petersen graph, labeled. If \(\textbf{G}\) is a graph on \(n\) vertices and each vertex in \(\textbf{G}\) has at least \(\frac{n}{2}\) neighbors, then \(\textbf{G}\) is hamiltonian. This gallery depicts Lindsey Ogle's Survivor career. /Filter /FlateDecode I'm really glad that I put in all the effort to do the things that I did to get on here. I feel like I'm good with it. Oh! The Petersen graph has the component property of the theorem but is not Hamil-tonian. endobj And I didn't wanna do it. << endobj /im18 312 0 R argo parts amazon. >> Like, duh. It was a tiebreaker [in the Reward]. /CropBox [0 1.44 414.84 642] This graph has ( n 1 2) + 1 edges. /Parent 5 0 R /Subtype /Type1 >> A connected graph G is an Euler graph if and only if all b) How many edges are there in Petersen graph? /F0 28 0 R Lindsey Ogle. 17 0 obj WebAmong the six incarnations of the Petersen graph, the middle one in the bottom row exhibits just 2 crossings, fewer than any other in the collection. Let's just say that. In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a string. stream /XObject 224 0 R /CropBox [0 2.16 414.39999 643] You control three characters. The key to a successful condition sufficient to guarantee the existence of a Hamilton cycle is to require many edges at lots of vertices. 584 584 556 1015 667 667 722 722 667 611 /Contents [225 0 R 226 0 R 227 0 R 228 0 R 229 0 R 230 0 R 231 0 R 232 0 R] /Thumb 75 0 R /Thumb 252 0 R Kick 'em in the face guys! /XObject 202 0 R As an example, consider the graph \(\textbf{G}\) shown in Figure 5.14. /MediaBox [0 0 418 642] %PDF-1.3 But I had to take it and learn some lessons from it. endobj Since the Petersen graph is regular of degree three, we know that it can't have a subgrpah that's a subdivision of \(K_5\text{,}\) as it would need to have Kuratowski's Theorem proof . Using your notation, we have that $n=10$, $m=15$. Inspecting the graph, we see that (1) each edge is included in exactly two faces, and (2) each c If there is no such integer, since there are edges that have not yet been traversed, then we have discovered that the graph is disconnected. 750 750 750 750 222 222 333 333 350 556 Google has many special features to help you find exactly what you're looking for. I mean, let's be honest, Cliff has like a six-foot reach. (EDIT: Im an idiot. /Font << Thank you very much. >> When the subroutine halts, we consider two cases. /CropBox [0 7.2 414.75999 648] Its really good. HVn0NJw/AO}E }, You should note that Theorem 5.13 holds for loopless graphs in which multiple edges are allowed. << /Resources << /im13 307 0 R /Filter /FlateDecode Lookup the home address and phone 3022458858 and other contact details for this person I think that was a fluke. The problem seems similar to Hamiltonian Path which is NP complete problem for a general graph. /Font << HitFix: OK, so you're pacing back and forth. Absolutely not! Therefore, if the graph is not connected (or not strongly connected, for HitFix: And are you actually rooting for them? Webgraph has components K1;K2;::: ;Kr. 7 What is string in combinatorics and graph theory? Who would I look like? People may say that its a cop-out, that I blamed it on my daughter, but thats the most ridiculous thing I have ever heard. Jeff Probst hailed this as a strange sort of Survivor first. Start a path at any node of the graph by leaving through one of its two edges. At the next node on the other end of that edge we find another edge % For Eulerian Cycle, any vertex can be middle vertex, therefore all vertices must have even degree. Even so, lots of people keep smoking. I usually get along with people, but Trish just rubbed me the wrong way. Sure. /Type /Font I don't let her watch it until I see it myself, but she watched it, we DVR it. /Type /Page << That's my whole plan. /Rotate 0 /Font << /Font << endobj In this case, we simply expand our original sequence \((x_0,x_1,,x_t)\) by replacing the integer \(x_i\) by the sequence \((u_0, u_1,,u_s)\). /Count 20 /Filter /FlateDecode endobj How does this work? WebShow that the Petersen graph is a minor of the graph from Midterm Practice Problem P2. Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph. Combinatorics is related to graph theory in it can be used to predict how long it will take to cover a entire graph. /XObject 86 0 R /Rotate 0 21 0 obj [BvZmOf7?@)`FxZy]+CK&c$l3s~Me+{SH Qaq|%x9'BLn$R)w!`T\xv_x.YS2v LzN1L bzK,~%PsNq%p7Y^uRB2u g^Yy", :{]lw, X4]F95[xaR^zrtu(Ly1h) oTtfuSU7wAuUL&~fFu,wZ o-3-TZ 2'*pqZgNYo6R[|$y+U1NF endobj With the Brawny tribe, the personalities are strong. I'm like, OK. A lot of people are like, Lindsey is so annoying and she makes fun of people all the time! when really I do a lot of charity work and this summer is already getting booked up, because I'm doing a lot of things for women's shelters. I don't know. Thank you very much. She's a bitch. If \(j \geq 0\), set, \(N_j = \{y: u_jy\) is an edge in G and has not yet been traversed.\(\}\), If \(N_j \neq \0 \), we take \(u_{j+1}\) as the least positive integer in \(N_j\). 24 0 obj >> Euler graphs and Euler circuits go hand in hand, and are very interesting. Returning to camp after losing her closest ally, NBA star Cliff Robinson, Ogle got into a heated argument with fellow castaway Trish Hegarty. /Font << Figure 6.3. Without Jeff Probst coming out on the beach, etc? That's still what I'm feeling like, Oh! /Thumb 85 0 R Also to keep in mind: Your final version of your project is due Tuesday, November 24. WebAn Eulerian trail is a path that visits every edge in a graph exactly once. << >> I didnt want to do that.. I like interesting games, breaking with the mainstream. (a) (b) (c) Figure 2: A graph containing an Euler circuit (a), one containing an Euler path (b) and a non-Eulerian graph (c) 1.4. This is the famous Petersen graph which is a connected, undirected graph with 10 vertices and 15 edges. /Widths [750 278 278 355 556 556 889 667 191 333 /Contents [254 0 R 255 0 R 256 0 R 257 0 R 258 0 R 259 0 R 260 0 R 261 0 R] The cookie is used to store the user consent for the cookies in the category "Performance". At what point is the marginal product maximum? Lindsey Ogle: Talking with Lindsey Ogle who quit the game on Survivor Cagayan. I could use the million dollars; who couldnt? Chapter 5 Eulerian Graphs and Digraphs. >> >> /Parent 7 0 R It gives them good TV. /Rotate 0 For G = G a, the Petersen graph with one vertex deleted. >> << I needed to settle down and collect myself. /XObject 191 0 R If G has closed Eulerian Trail, then that graph is called Eulerian Graph. Rob also speaks with Lindsey Ogle about quitting the game on this weeks episode of Survivor Cagayan. Why friction is a necessary evil Class 8? \. 278 278 278 469 556 333 556 556 500 556 Leonhard Euler settled this problem in 1736 by using graph theory in the form of Theorem 5.13. 27 0 obj /Resources << Euler(ian) circuit, Euler(ian) path (n.): An Euler path (a.k.a. 2 0 obj Even the pole challenge. We then choose the least integer \(i\) for which there is an edge incident with \(x_i\) that has not already been traversed. (b) Explain why there is no Eulerian circuit of the Petersen graph, and state the minimum number of edges you would need to add to the Petersen graph in order for there to be an Eulerian circuit. It is the smallest bridgeless cubic graph with no Hamiltonian cycle. << endstream WebAnswer: A circuit over a graph is a path which starts and ends at the same node. We use cookies to help provide and enhance our service and tailor content and ads. Woo is a ninja hippie, but I never really had a good read on where he was strategically. WebWhat are Eulerian graphs and Eulerian circuits? >> << xo, Lindsey And I wasn't gonna risk being that person. What is the value of v e + f now? We got back to camp and I was kind of in shock. WebThe Petersen graph is non-hamiltonian. /MediaBox [0 0 417 642] I don't even want to tell you! I told him, I don't feel comfortable with this. >> WebH1. /XObject 106 0 R >> I think together we kinda just talked and he's like, If there's any doubt whatsoever, you've gotta let me know. It was one of those where I'm like, Man. /Type /Font On Wednesday (March 26) night's Survivor: Cagayan, Lindsey Ogle quit because of her concerns that if she continued to spend time with gloating Bostonian Trish, something bad might happen. Lets see who winshaha. endobj /Contents [66 0 R 87 0 R 88 0 R 89 0 R 90 0 R 91 0 R 92 0 R 93 0 R 94 0 R] 12 0 obj These islands were connected to the mainland by seven bridges as indicated in Figure 5.12. /Resources << /F0 28 0 R By contracting edges (1, 6), (2, 7), (3, 8), (4, 9) and (5, 10) we can obtain a K 5 minor. /im1 295 0 R /ProcSet [/PDF /Text /ImageB] /Contents [107 0 R 108 0 R 109 0 R 110 0 R 111 0 R 112 0 R 113 0 R 114 0 R] Necessary cookies are absolutely essential for the website to function properly. Analytical cookies are used to understand how visitors interact with the website. A-143, 9th Floor, Sovereign Corporate Tower, We use cookies to ensure you have the best browsing experience on our website. Every 2-connected \(P_7\)-free graph of minimum degree at least three other than the Petersen graph has a spanning Eulerian subgraph. Did you watch the episode together? But opting out of some of these cookies may affect your browsing experience. Of course I knew that I was a mother. But you know, its over now. /Thumb 242 0 R /Type /Pages /Type /Font Is Petersen graph Eulerian graph? Lindsey and Sarah at Aparri camp. How did you react when it was happening?My hands started shaking. I feel like it's a variable but it is not the reason why. Clearly, \(n \geq 4\). Therefore, Petersen graph is non-hamiltonian. I'm sure. /Parent 5 0 R Ogle, a hairdresser from Indiana, tells PEOPLE that she has no regrets about quitting the show, but says that theres one contestant she will never like. /im16 310 0 R It wasn't like a blowout.