数学家的游戏 1.2 [free]

这是个数学游戏，游戏规则极简!!
新: 数学观+解悖+数学题+反/证明题
¤特色
-具有真实数学意义
-锻炼玩家数学技能
-通俗易懂[适合各程度数学玩家]
节选参考:
以下给出简要关键(细节请参考app):
定义:图内所有点边都能形成k团的图称为k团图。

k团图内所有(小于k)非k极大团(代称z)必由至少三个k团(其子集)构成,因
1)z不可能是某k团的子集。

2)若z属两个k团,但分别属两k团的点需要第三k团的边连接。

必先形成三个k团构成的z才能形成多于三个k团构成的z,因此仅考虑前者。

z内必有至少一3顶点团且其三边分别仅属三个k团,
每一k团必至少有一点(代称p)仅与上述三边其一边的两点有边,可利用p将任一z三分。

若选点时必不会选中z,则达成目标。

k完全图是最好的k团图,可通过逐步删边得到任一给定图。



This is a mathematical game, minimalist rules of the game !!
New: mathematical concept of the Solution of Paradox + + math + Anti / proofs
¤ Features
- with realistic mathematical sense
- exercise player math skills
- easy to understand [suitable for all level of players mathematics]
Excerpts Reference:
The following presents a simplified key (For details, see app):
Definition: FIG inner edges of all points k groups can form in FIG k groups referred to in FIG.
FIG k all the groups (less than k) non-maximal clique k (on behalf of said z) k must consist of at least three groups (a subset thereof), due to
1) z k can not be a subset of a group.
2) If z k belong to two groups, respectively, but the case of two-point k of the third group requires k connection side groups.
Z must first forming group composed of three to form k z k groups consisting of more than three, so only to the former.
Z must be at least one of the group of vertices 3 and which are merely three triangular k groups,
Each group must have at least one point k (on behalf of said p) only to the three sides of its two side edges has, p can be any using a z-third.
If the election does not necessarily point to select z, then achieve their goals.
k is a complete graph in FIG best k groups, can be obtained by progressively deleting any given side of FIG.

• 06/18/2018: 数学家的游戏 1.2
• Report a new version