Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G3671960635, NeTS-NOSS: Collaborative Research: Doing More with Less: Tracking Movements Using a Sparse Sensor Network, Extremal and Probabilistic Graph Theory: Spectra, Subgraph Counts, and Graph Sequences, G7452299184, Foundations of Coverage and Connectivity for Wireless Sensor Networks Deployed in Thin Strips
OpenAlex ID: W2951784498