Mei Lu

Counting sunflowers with restricted matching number

For H ⊆ ( [ n ] k ) , let ν ( H ) denote its matching number and let d H ( E ) denote the codegree of a ( k − 1 ) -set E . We study the codegree moments c o p ( H ) = ∑ E ∈ ( [ n ] k − 1 ) d H ( E ) p and the number of copies of the k -uniform l -petal sunflower S k , l k − 1 who...