arXiv (All)
open access
Distinguishing graphs with simple spectrum by homomorphism counts
We study which graph classes determine every graph with simple spectrum up to isomorphism by homomorphism counts from their members. We show that such a class has unbounded treewidth and Euler genus and contains a graph with the complete graph on seven vertices as a minor. To prove these conditions,
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
- Almost all graphs are determined by their generalized spectrum#1247974
- Local modifications in planar hypohamiltonian graphs#1356546
- There are no nontrivial chordal square-complementary graphs#1076358
- Arboricity and Simplicial Geometric Category of Wedges and Joins of Graphs#1034416
- Groupoids of finitely aligned higher-rank graphs via filters and graph morphisms#1069675
Record · ID 1233081
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