Pages that link to "Item:Q3057061"
From MaRDI portal
The following pages link to On recognizing graphs by numbers of homomorphisms (Q3057061):
Displaying 13 items.
- Polyadic sets and homomorphism counting (Q2094593) (← links)
- Fractional isomorphism of graphons (Q2095107) (← links)
- Discrete density comonads and graph parameters (Q2104475) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- Approximating fractionally isomorphic graphons (Q6115784) (← links)
- The pebble-relation comonad in finite model theory (Q6563056) (← links)
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability (Q6601300) (← links)
- Logical equivalences, homomorphism indistinguishability, and forbidden minors (Q6647759) (← links)
- The pebble-relation comonad in finite model theory (Q6649442) (← links)
