Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Crudele, Gabriel"'
Given two non-empty graphs $H$ and $T$, write $H\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\cdot,\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient conditions
Externí odkaz:
http://arxiv.org/abs/2305.16542
Publikováno v:
Discrete Analysis, 2024:8, 26 pp
A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and only if the
Externí odkaz:
http://arxiv.org/abs/2303.04776