Extremal problems with uniform density constraints – Bc. Filip Kučerák
Bc. Filip Kučerák
Bachelor's thesis
Extremal problems with uniform density constraints
Extremal problems with uniform density constraints
Abstract:
Jedným z klasických problémov extremálnej kombinatoriky je určiť maximálny počet hrán grafu s n vrcholmi, ktorý neobsahuje zakázaný podgraf F. Napriek mnohým výsledkom v štandardnom režime grafov je naše chápanie problémov týkajúcich sa hypergrafov veľmi obmedzené. Jeden zo známych problémov, na ktorý nemáme odpoveď aj po päťdesiatich rokoch, je Turánov problém štvorstenu z roku 1961. V tomto probléme …moreAbstract:
A classical problem in extremal combinatorics is to determine the maximum number of edges a graph on n vertices can have while not containing a forbidden subgraph F. Despite many results in the standard setting of graphs, very little is known about problems concerning hypergraphs. A canonical example of our limited understanding is the famously open problem of Turán from 1961. The problem asks to determine …more
Language used: English
Date on which the thesis was submitted / produced: 19. 12. 2023
Identifier:
https://is.muni.cz/th/pgzq6/
Thesis defence
- Date of defence: 12. 2. 2024
- Supervisor: prof. RNDr. Daniel Kráľ, Ph.D.
- Reader: RNDr. Vít Musil, Ph.D.
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Informatics / Informatics
Theses on a related topic
- No theses on a related topic available.