Zobrazeno 1 - 1
of 1
pro vyhledávání: '"68R10 (Primary) 68R05 (Secondary)"'
An independent set in a graph $G$ is a set $S$ of pairwise non-adjacent vertices in $G$. A family $\mathcal{F}$ of independent sets in $G$ is called a $k$-independence covering family if for every independent set $I$ in $G$ of size at most $k$, there
Externí odkaz:
http://arxiv.org/abs/2308.15671
