Discrete Mathematics
弱独立数
Weak independence numberA parameter of a hypergraph that counts the maximum number of vertices that can be selected such that no edge contains more than one selected vertex. / 超图的一个参数，用于计算在没有任何边包含超过一个选定顶点的情况下，可以选出的最大顶点数。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-10-23 20:01:24
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
Hypergraph: The structure being analyzed / 超图：被分析的结构Weak independence number: The maximum size of a set of vertices with no edge containing more than one vertex from the set / 弱独立数：边中不包含集合中超过一个顶点的顶点集的最大大小
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsConcentration of the hypergraph's weak independence numberOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Weak independence number.
Node update feedback
review required