Pinning–the very start (very modest)

The following trivial observation (OK, it’s a version of Axiom of Choice :-)) is still useful:

every family admits a pinning of cardinality not higher than that of the family itself.

It follows easily from my earlier intro how small pinnings lead to cliques. But here let me write down my first steps. Consider 2-coloring:

    \gamma : \binom X3 \rightarrow \{0 1\}

What can we say about the pinnings when there is no unicolor tetrahedron?

  • When |X|=4 then it is necessary and sufficient that there is at least one triangle of each color; and it’s easily possible, hence there may be no unicolor tetrahedron (there is one altogether anyway :-)).
  • Now let  |X| = 5.  Any two triangles have at least one vertex in common (because  |X| = 5)).&nbsp Thus if no more than 2 triangles are painted in one of the colors then they admit a 1-element pinning, hence the tetrahedron of the remainng 4 vertices is unicolored (has all its triangular faces colored by the other color). Thus the assumption about the absence of the unicolored tetrahedrons implies that there are at least 3 different triangles painted in each of the colors. And indeed, such coloring, say in  X := \{0\ 1\ 2\ 3\ 4\},  free of unicolored tetrahedrons, is possible:

      blue  \triangle\!-\!s:\ \ \ \{0\ 1\ 2\}\ \ \{0\ 1\ 3\}\ \ \{2\ 3\ 4\}

      red  \triangle\!-\!s:\ \ \ \{1\ 2\ 4\}\ \ \{1\ 3\ 4\}\ \ \{0\ 2\ 3\}

    And the remaining 4 triangles (for a total of 10) can be painted arbitrarily.

    This is already a result of interest. When  X  has any finite number of elements then any 5-element subset houses at least 3 triangles of each color which is a significant restriction.

  • Now let  |X| = 6,  say  X := \{0\ 1\ 2\ 3\ 4\ 5\}.  Then  \{0\ 1\ 2\ 3\ 4\},  contains  k \ge 3  different triangles colored blue. If  k = 3  then there is a vertex, say vertex  0,  which pins at least 2 blue triangles, thus leaving at the most one blue triangle (inside  \{0\ 1\ 2\ 3\ 4\}).  Thus there are at least 2 more blue triangles within  \{1\ 2\ 3\ 4\ 5\},  for a total of at least 5 different blue triangles in the whole  X.

    Next, let  \{0\ 1\ 2\ 3\ 4\},  contain  k = 4  different triangles colored blue. Then there are 4*3 = 12 incident pairs blue_triangle-vertex, and  \frac{12}5 > 2,  which means that there is a vertex, say vertex  0,  which pins at least 3 blue triangles, thus leaving at the most one blue triangle (inside  \{0\ 1\ 2\ 3\ 4\}).  Thus there are at least 2 more blue triangles within  \{1\ 2\ 3\ 4\ 5\},  for a total of at least 6 different blue triangles in the whole  X.

    In the remaining case of  k \ge 5  there are at least 5 different blue triangles in  X  right away.

    Thus there are at least 5 different blue triangles always (under the assumption of no unicolored tetrahedron).

    Everything that was said about blue holds also for red. Thus if  |X| = 6,  and there is no unicolor tetrahedron, then there are at least 5 different triangles of each color.

Go to bed in the same time every cialis on sale robertrobb.com night and cut down napping time during the day. Forget about jewellery and roses and viagra canada deliver make sure to gift your friends or relatives, you can easily buy this medication and avail a high quality erection health within few minutes of intake. In this present era, erectile dysfunction has order viagra australia turned into the most popular oral drug solution of men’s erection issue. Back and pubis pain Backache is a common side-effect of pregnancy with up to three quarters of mums-to-be experiencing some degree of pain. cheap generic levitra

Leave a Reply

Your email address will not be published. Required fields are marked *