Autor:	Bill Kay, Andrii Arman, Vojtěch Rödl
Rok vydání:	2019
Předmět:	Combinatorics Delta Discrete mathematics Discrete Mathematics and Combinatorics Element (category theory) Upper and lower bounds Theoretical Computer Science Mathematics
Zdroj:	Discrete Mathematics. 342:3034-3042
ISSN:	0012-365X
Popis:	Let F be a family of n -element sets. In 1995, Axenovich, Fon-Der-Flaass and Kostochka established an upper bound on the size of F that does not contain a Δ -system with q = 3 sets. Using the ideas of their proof we extend the results to an arbitrary q .
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5c20f9b60a48325a1929d38904a48c7b https://doi.org/10.1016/j.disc.2019.06.013 Zobrazit plný text záznamu Full Text from ScienceDirect