arXiv (All)
open access
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
Lovász (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$. Subsequently, a substantial line of work studied homomorphism indistingui
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups#822260
- Finite graphs and configurations of points#984065
- MESS: Fast and Private Semantic Search on Multi-Graph HNSW#422203
- Quantum Query Lower Bounds for Triangle-Listing and Spanners#1132292
- 28 CFR Part 4 — Procedure Governing Applications for Certificates of Exemption Under the Labor-Management Reporting and Disclosure Act of 1959, and the Employee Retirement Income Security Act of 1974#507662
Record · ID 998092
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive