| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903793 | Journal of Combinatorial Theory, Series A | 2018 | 10 Pages |
Abstract
Our approach is based on the use of regular bipartite graphs. These graphs are quite often used in Extremal Set Theory problems, however, the approach we develop proves to be particularly fruitful.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andrey Kupavskii, Dmitriy Zakharov,