Bounding the independence number in some (n,k,,)-hypergraphs
From MaRDI portal
(Redirected from Publication:1756034)
Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A note on Ramsey numbers
- A note on the independence number of triangle-free graphs
- Adversarial resilience of matchings in bipartite random graphs
- Counting designs
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- scientific article; zbMATH DE number 3349865 (Why is no real title available?)
- Note on independent sets in steiner systems
- On chromatic number of graphs and set-systems
- On independent sets in hypergraphs
- On the independence number of Steiner systems
- Probabilistic methods for algorithmic discrete mathematics
- Reducibility among combinatorial problems
- The CRC handbook of combinatorial designs
Cited in
(4)
This page was built for publication: Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756034)