Daisies and Other Turan Problems
classification
🧮 math.CO
keywords
problemssometurancertainconjecturesdaisiesdaisydaisy-free
read the original abstract
We make some conjectures about extremal densities of daisy-free families, where a `daisy' is a certain hypergraph. These questions turn out to be related to some Turan problems in the hypercube, but they are also natural in their own right.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.