Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Katona, G. O. H."'
Autor:
Frankl, P., Katona, G. O. H.
Let $n > k > t \geq j \geq 1$ be integers. Let $X$ be an $n$-element set, ${X\choose k}$ the collection of its $k$-subsets. A family $\mathcal F \subset {X\choose k}$ is called $t$-intersecting if $|F \cap F'| \geq t$ for all $F, F' \in \mathcal F$.
Externí odkaz:
http://arxiv.org/abs/2101.03015
Publikováno v:
Geometry, Structure and Randomness in Combinatorics, 47--59. CRM Series, 18, 2015
Let $X$ be an $n$--element finite set, $0
Externí odkaz:
http://arxiv.org/abs/1403.3847
Autor:
DAMÁSDI, G.1 damasdigabor@caesar.elte.hu, GERBNER, D.2 gerbner@renyi.hu, KATONA, G. O. H.2 katona@renyi.hu, METHUKU, A.2 abhishekmethuku@gmail.com, KESZEGH, B.2 keszegh.balazs@renyi.mta.hu, LENGER, D.1 lengerd@cs.elte.hu, NAGY, D. T.2 nagydani@renyi.hu, PÁLVÖLGYI, D.1 dom@cs.elte.hu, PATKÓS, B.2 patkos@renyi.hu, VIZER, M.3 vizermate@gmail.com, WIENER, G.4 wiener@cs.bme.hu
Publikováno v:
Acta Mathematica Universitatis Comenianae. 2019, Vol. 88 Issue 3, p601-609. 9p.
Autor:
Katona, G. O. H., Woyczyński, W. A.
Publikováno v:
Networks; Jul1993, Vol. 23 Issue 4, p327-332, 6p
Publikováno v:
Annals of the New York Academy of Sciences; 1989, Vol. 555 Issue 1, p150-158, 9p
Autor:
Katona, G. O. H.
Publikováno v:
Probability Theory and Related Fields; September 1982, Vol. 60 Issue: 3 p411-423, 13p
Autor:
Erdös, Péter L., Katona, G. O. H.
Publikováno v:
Graphs and Combinatorics; December 1986, Vol. 2 Issue: 1 p123-134, 12p
Autor:
Demetrovics, J., Katona, G. O. H.
Publikováno v:
Annals of Mathematics and Artificial Intelligence; March 1993, Vol. 7 Issue: 1-4 p63-82, 20p
Publikováno v:
Theoretical Computer Science; 1998, Vol. 190 Issue: 2 p151-166, 16p