Discrete Mathematics
长圈覆盖团
Clique Covering by Long CyclesA graph theory problem concerning the number of cliques within a graph that can be covered by cycles of a specified length. / 图论问题，涉及特定长度的圈能够覆盖的图中团的数量。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-11-05 21:05:20
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
graph: The input graph structurecycle length: The specified length of the cycles used for covering
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsFurther results on the number of cliques in graphs covered by long cyclesOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Clique Covering by Long Cycles.
Node update feedback
review required