arXiv (OAI Expanded)
open access
A Four-Connected Graph without a Legal System
In a 2021 paper, Jankiewicz, Norin, and Wise asked whether there exists a finite $4$-connected graph of girth at least four and nonnegative Charney--Davis curvature such that no $4$-connected ordinary subgraph admits a legal system. We construct such a graph by starting from the hexagonal prism and
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
- Disconnected graphs and extremal bounds for realizable distance orders#616985
- Disconnected graphs and extremal bounds for realizable distance orders#616485
- Extending Courcelle's Theorem with Optimality Predicates#1110318
- The Tight Upper Bound on the Number of Distinct Squares in Circular Words#1116415
- An improved upper bound for oriented diameter of graphs with diameter $4$#1077454
Record · ID 1071209
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