Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Krieger, Michael M."'
Publikováno v:
ANNALES UNIV. SCI. BUDAPEST., SECT. MATH. 65 (2022), 9-30
For integers $r,t\geq2$ and $n\geq1$ let $f_r(t,n)$ be the minimum, over all factorizations of the complete $r$-uniform hypergraph of order $n$ into $t$ factors $H_1,\dots,H_t$, of $\sum_{i=1}^tc(H_i)$ where $c(H_i)$ is the number of maximal cliques
Externí odkaz:
http://arxiv.org/abs/2309.03083
Publikováno v:
16th Annual Symposium on Foundations of Computer Science (SFCS 1975); 1975, p163-168, 6p
Autor:
Krieger, Michael M.
Publikováno v:
Annals of the New York Academy of Sciences; 1971, Vol. 175 Issue 1, p265-271, 7p