Proving At Least 3 Pure Triangles in a Complete Heptagon

Click For Summary
SUMMARY

The discussion centers on proving that a complete heptagon, when its edges are colored with two different colors, will contain at least three pure triangles. The initial analysis shows that if a vertex has at least three edges of the same color, it can lead to the formation of pure triangles. Specifically, if three edges incident to a vertex are blue, and any of the connecting edges between those vertices are also blue, a blue triangle is formed. Conversely, if those edges are red, a red triangle is created. The challenge lies in demonstrating the existence of a third pure triangle, particularly when there are four edges of one color incident to a vertex.

PREREQUISITES
  • Understanding of combinatorial geometry
  • Familiarity with graph theory concepts
  • Knowledge of triangle properties in polygonal structures
  • Experience with mathematical proof techniques
NEXT STEPS
  • Study the properties of complete graphs and their edge colorings
  • Research combinatorial proofs related to triangle formation in polygons
  • Explore the concept of Ramsey theory in relation to graph coloring
  • Learn about the application of induction in combinatorial proofs
USEFUL FOR

Mathematicians, students studying combinatorial geometry, and educators looking to enhance their understanding of graph theory and triangle properties in polygonal structures.

Solarmew
Messages
37
Reaction score
1
errrr, THEOREM >.< ... oops ...

Homework Statement


Prove that when edges of a complete heptagon are colored with two different colors, there will be at least three pure triangles.

Homework Equations


The Attempt at a Solution


i can do two pure triangles, but not three :cry:
pick a vertex v. It has 6 edges incident to it, at least 3 of which are the same color.
1. Suppose 3 of these edges, connecting to vertices r, s and t, are blue. If any of the edges (r, s), (r, t), (s, t) are also blue then we have an entirely blue triangle. If not, then those three edges are all red and we have an entirely red triangle. Same goes for the other 3 edges incident to v, say red, that are connected to other 3 vertices, say a, b, c. Therefore we have 2 pure triangles.
2. Suppose at least 4 edges connecting v to r, s, t, u are blue. Then the least amount of pure triangles connecting r,s,t,u is 0 when the internal diagonals are blue and the outside square is red. But since we have two blue diagonals, each connected to v by two blue edges, we have 2 pure triangles.

now any ideas as far as how to get the third? :confused:
 
Physics news on Phys.org
i've been fiddling with the picture in photoshop XD because I'm a visual learner XD
1.JPG

and i kinda see what's going on, just not sure how to put it into words, or if I'm even on the right track or if I'm over complicating this X.X

but if there are at least 4 edges incident to v s.t. we have at most 2 pure triangles (if we connect the other two red vertices with the same color line, we're done, otherwise...), then the outsides edges r-s-t-u are all red, which means if they make up the bases of some triangles, the other two edges for each of those triangles must be different colors (since we want to try to avoid having 3 pure triangles, but seeing if we'll be forced to)
2.JPG
3.JPG


since we have to alternate colors, they eventually create another triangle ... so I'm convinced of that now ... just don't know how to show it properly :\

i can also kinda see how we're forced to have the third pure triangle when we have 3 red and 3 blue edges coming out of v, but again, not sure how to put it into math form XD
 
Last edited:
No one? XD well at least I dun feel so bad now XD
 

Similar threads

Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
2
Views
1K