Pseudo sunflowers (Q2143417)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Pseudo sunflowers	scientific article

Statements

scholarly article

0 references

Pseudo sunflowers (English)

0 references

European Journal of Combinatorics

0 references

publication date

31 May 2022

0 references

zbMATH Keywords

\(k\)-uniform family

0 references

Erdős-Rado sunflower lemma

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejc.2022.103553

0 references

Intersection Theorems for Systems of Sets

0 references

Intersection Properties of Systems of Finite Sets

0 references

0 references

Every large set of equidistant (0,+1,-1)-vectors forms a sunflower

0 references

Intersection theorems for systems of sets

0 references

On the combinatorial problems which I would most like to see solved

0 references

0 references

Improved bounds for the sunflower lemma

0 references

0 references

On intersecting families of finite sets

0 references

0 references

Inequalities for minimal covering sets in set systems of given rank

0 references

Covers in uniform intersecting families and a counterexample to a conjecture of Lovász

0 references

An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)

0 references

A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJC.2022.103553

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2143417

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2143417&oldid=38904746"