Back to search

applied mathematics

向日葵引理

Sunflower Lemma

A fundamental result in extremal set theory stating that for any positive integers p and k, there exists a number N(p, k) such that any family of sets of size k with more than N(p, k) members contains a sunflower with p petals. / 极端集合论中的一个基本结果,指出对于任意正整数 p 和 k,存在一个数 N(p, k),使得任何大小为 k 且成员数超过 N(p, k) 的集合族都包含一个具有 p 个花瓣的向日葵。

Knowledge type
数学理论
First proposed or discovered
Proposer
Turkey Farm member
Creator
农场主
Last updated
2026-11-04 22:05:57
Login to save this node.

Sub-knowledge points

Erdős–Rado Sunflower LemmaDelta-system

Higher-order knowledge points

CombinatoricsRamsey TheoryAlgebraic Combinatorics

Main parameters and performance indicators

p: The number of petals in the sunflower (restricted matching number).k: The size of each set in the family.

Open problems

Determining the exact value of the sunflower number N(p, k).Finding the best possible upper bounds for N(p, k).

Related literature

ranked by community stars
Counting sunflowers with restricted matching numberOpen source

Related products and links

No item recorded yet

Creation and modification trail

1 records
automated knowledge publish农场主2026-11-04 22:05:57

Record title: Sunflower Lemma.