Year: 2019
Type: article
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 .
Source: Journal of Combinatorial Designs
DOI: 10.1002/jcd.21690
Author: Alexander Sidorenko
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2984558730