arXiv (All)
open access
Counterexamples to the Strong Roberson Conjecture
We refute the Strong Roberson Conjecture, which asserts that adding any graph outside a class closed under minors and disjoint unions strictly increases the distinguishing power of homomorphism counts from that class. More precisely, we construct connected graphs $H$ for which counts from graphs exc
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
- On reducible partition of graphs and its application to Hadwiger conjecture#821635
- Every graph with no $K_7^=$ minor is 6-colorable#1011483
- A Proof of the Linear Hadwiger Conjecture#1201304
- On graphs whose powers are well-covered#1233339
Record · ID 1188228
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