arXiv (All)open access
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
combinatorics, discrete mathematics, logic in computer science
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 998092
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.