Subgraph-count characterization of monomial digraphs
Determine whether there exist finitely many digraphs D1,…,Dk such that any two monomial digraphs D(q;m,n) and D(q′;m′,n′) are isomorphic if and only if they contain the same number of copies of each Di as subdigraphs.
References
Problem 6. Are there digraphs D1, . . . , Dk such that any two monomial digraphs D = D(q; m, n) and D′ = D(q′; m′, n′) are isomorphic if and only if |D(Di)| = |D′(Di)| for each i = 1, . . . , k?
— Some families of graphs, hypergraphs and digraphs defined by systems of equations
(2503.07915 - Lazebnik et al., 10 Mar 2025) in Problem 6, Section 4.11
Does there exist a finite family $ \mathcal H $ of digraphs, such that, for sufficiently large prime power $ q $ and all parameter pairs, the equalities $ n\mleft( H , D_1 \mright) = n\mleft( H , D_2 \mright) $ for every $ H \in \mathcal H $ imply $ D_1 \cong D_2 $? The authors have not been able to find such a family.
— Isomorphism Criterion of Monomial Digraphs over Prime Fields
(2610.06735 - Kodess et al., 5 Oct 2026) in Section 4, Concluding Remarks