Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Bohnert, Dominik"'
Autor:
Bohnert, Dominik, Winter, Christian
A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of $\mathcal{G}$
Externí odkaz:
http://arxiv.org/abs/2305.01748
Autor:
Bohnert, Dominik, Winter, Christian
Publikováno v:
Graphs & Combinatorics; Dec2024, Vol. 40 Issue 6, p1-10, 10p
