Community

Art of Problem Solving holds many free classes called Math Jams.
Click here for transcripts to past Math Jams.
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Sat Dec 05, 2009 3:18 am
All times are UTC - 8
View posts since last visit
View unanswered posts
6.11
Moderators: Altheman, harazi
Post new topic   Reply to topic View previous topicView next topic
2 Posts • Page 1 of 1
Author Message
Altheman
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 28 Jun 2005
Posts: 6121
Location: Illinois
United States

To rate posts you must be logged in
#1
6.11
IMO 2001 Shortlist

G is a finite graph such that it does not contain a
complete subgraph with 5 vertices, and any two triangles have
at least point in common. Show that there are at most two
points where removal leaves no triangles.
_________________
-Alex
Altheman's Problem Column

PostPosted: Wed Jul 22, 2009 6:10 pm  Back to top 
  ProfilePMAIMBlog
bpgbcg
Poincare Conjecture
Poincare Conjecture

Offline
Joined: 28 Apr 2008
Posts: 112
Location: 39 latitude, 77 longitude
United States

To rate posts you must be logged in
#2
Click to reveal hidden content
If there are no triangles, it is trivial. Assume there is at least one triangle. Each other triangle shares a vertex with that triangle. Assume for the sake of contradiction that there do not exist 2 such points. Then for each vertex of that triangle, there is another triangle that contains that vertex and no other vertices of the original triangle.
Lemma: There exists a complete 4-point subgraph of the graph.
By the above observation, no triangle we are considering shares 2 vertices with the original triangle. Then each of the three triangles at the corners must share a vertex with each other. If all three triangles share 1 vertex, there is clearly a complete 4-point subgraph (the original triangle and that vertex). If some two triangles share 2 vertices, there is again a complete 4-point subgraph. The last case is that there are 3 other points, each shared by 2 of the triangles
We can see that there are 2 triangles that do not share a common vertex, so the lemma is proven.
No triangle can share 0 or 1 vertices with this subgraph. Thus each triangle must share at least 2 points with it. The removal of any 2 points out of the 4 will remove all of the triangles among the 4 points of the subgraph, so we must just consider triangles sharing exactly 2 points with the subgraph. If we remove two of the points of the 4-point subgraph, and not all of the triangles are removed, there must be a triangle that contains the 2 other vertices of the 4-point subgraph, and is not fully contained in this subgraph. If we remove the other two vertices of the subgraph, there exists such a triangle which contains the other two points of the subgraph. These two triangles must share as vertex. The 4-point subgraph and this point together make up a complete 5-point graph, a contradiction.

_________________
Please play the piano and fail after midnight so that residents can have a^p mod p better sleep.

Over 100 posts!!!

PostPosted: Thu Oct 22, 2009 11:40 am  Back to top 
  ProfilePM
Display posts from previous:   Sort by:   
2 Posts • Page 1 of 1
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us