• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

The Union-Closed Families Conjecture

Student: Serdyukov Innokentiy

Supervisor: Michael Vyalyi

Faculty: Faculty of Computer Science

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 9

Year of Graduation: 2019

Call a family of sets union-closed if for any two member-sets of this family it also contains their union. Frankl's conjecture states that if union-closed family has at least one nonempty member-set, then there exists an element contained in at least half of the member-sets. This conjecture has remained an open problem for almost 40 years. Looking for some local configurations in the family is the most efficient method of proving satisfiability of special cases of conjecture by this time, such configurations are called FC-families. In this paper generalization of Frankl's conjecture and FC-families are considered, proof of generalized criterion of Frankl-Completeness is provided. Also proof of some bounds on values connected to FC-families is given.

Full text (added May 15, 2019)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses