scientific article
From MaRDI portal
Publication:2713359
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6610(2001)9:2<100::AID-JCD1001>3.0.CO;2-W" /><100::AID-JCD1001>3.0.CO;2-W 10.1002/1520-6610(2001)9:2<100::AID-JCD1001>3.0.CO;2-WzbMath0971.05035MaRDI QIDQ2713359
Publication date: 21 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Saturation numbers for disjoint stars
Cites Work
- Supersaturated graphs and hypergraphs
- On a packing and covering problem
- A class of constructions for Turan's (3,4)-problem
- What we know and what we do not know about Turán numbers
- Asymptotically optimal covering designs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Saturated graphs with minimal number of edges
- On complete subgraphs of different orders
- A Remark on the Number of Complete and Empty Subgraphs
- The Minimum Size of Saturated Hypergraphs
This page was built for publication:
