Prefer a chat interface with context about you and your work?
Approximate Steiner (<i>r</i> − 1, <i>r</i>, <i>n</i>)‐systems without three blocks on <i>r</i> + 2 points
Abstract For a family of ‐graphs, let denote the maximum number of edges in an ‐free ‐graph on vertices. Let denote the family of all ‐graphs with edges and at most vertices. We prove that .