Discrete Mathematics
完全三部分子图
Complete tripartite subgraphsA complete tripartite subgraph is a subgraph of a graph whose vertex set can be partitioned into three disjoint subsets such that every vertex in one subset is adjacent to every vertex in the other two subsets. / 完全三部分子图是指顶点集可以划分为三个不相交子集的图的一个子图，其中每个子集中的顶点都与另外两个子集中的所有顶点相邻。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-11-03 23:05:33
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
Graph: The parent graph structurePartition: The division of vertices into three subsetsMinimum degree: A lower bound on the degree of vertices in the parent graph
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsComplete tripartite subgraphs of balanced tripartite graphs with large minimum degreeOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Complete tripartite subgraphs.
Node update feedback
review required