Coloring-flow duality of embedded graphs
Bibliographic record
Abstract
Let $G$ be a directed graph embedded in a surface. A map $\phi : E(G) \rightarrow \mathbb {R}$ is a tension if for every circuit $C \subseteq G$, the sum of $\phi$ on the forward edges of $C$ is equal to the sum of $\phi$ on the backward edges of $C$. If this condition is satisfied for every circuit of $G$ which is a contractible curve in the surface, then $\phi$ is a local tension. If $1 \le |\phi (e)| \le \alpha -1$ holds for every $e \in E(G)$, we say that $\phi$ is a (local) $\alpha$-tension. We define the circular chromatic number and the local circular chromatic number of $G$ by $\chi _{\mathrm {c}}(G) =\inf \{ \alpha \in \mathbb {R} \mid {}$ $G$ has an $\alpha$-tension$\}$ and $\chi _{\operatorname {loc}}(G) = \inf \{ \alpha \in \mathbb {R} \mid {}$ $G$ has a local $\alpha$-tension$\}$, respectively. The invariant $\chi _{\mathrm {c}}$ is a refinement of the usual chromatic number, whereas $\chi _{\operatorname {loc}}$ is closely related to Tutte’s flow index and Bouchet’s biflow index of the surface dual $G^*$. From the definitions we have $\chi _{\operatorname {loc}}(G) \le \chi _{\mathrm {c}}(G)$. The main result of this paper is a far-reaching generalization of Tutte’s coloring-flow duality in planar graphs. It is proved that for every surface $\mathbb {X}$ and every $\varepsilon > 0$, there exists an integer $M$ so that $\chi _{\mathrm {c}}(G) \le \chi _{\operatorname {loc}}(G)+\varepsilon$ holds for every graph embedded in $\mathbb {X}$ with edge-width at least $M$, where the edge-width is the length of a shortest noncontractible circuit in $G$. In 1996, Youngs discovered that every quadrangulation of the projective plane has chromatic number 2 or 4, but never 3. As an application of the main result we show that such ‘bimodal’ behavior can be observed in $\chi _{\operatorname {loc}}$, and thus in $\chi _{\mathrm {c}}$ for two generic classes of embedded graphs: those that are triangulations and those whose face boundaries all have even length. In particular, if $G$ is embedded in some surface with large edge-width and all its faces have even length $\le 2r$, then $\chi _{\mathrm {c}}(G)\in [2,2+\varepsilon ] \cup [\frac {2r}{r-1},4]$. Similarly, if $G$ is a triangulation with large edge-width, then $\chi _{\mathrm {c}}(G)\in [3,3+\varepsilon ] \cup [4,5]$. It is also shown that there exist Eulerian triangulations of arbitrarily large edge-width on nonorientable surfaces whose circular chromatic number is equal to 5.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".