arXiv (All)
open access
Crown graphs maximise the representation number of bipartite graphs
The representation number of a graph is the least positive integer $k$ for which its vertices can be arranged in a word, each occurring $k$ times, so that two distinct letters alternate precisely when the corresponding vertices are adjacent. We prove that every bipartite graph on $N\ge9$ vertices ha
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
- Vizing's theorem for signed multigraphs#1117820
- The game chromatic number of generalized Mycielski graphs of paths and cycles#924181
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- Majority C-coloring in Cartesian products#780968
Record · ID 1130684
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