Flows on flow-admissible signed graphs

Matt DeVos, Jiaao Li, You Lu, Rong Luo, Cun Quan Zhang, Zhang Zhang

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 8
  • Captures
    • Readers: 4
see details

Abstract

In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero 6-flow. Bouchet himself proved that such signed graphs admit nowhere-zero 216-flows and Zýka further proved that such signed graphs admit nowhere-zero 30-flows. In this paper we show that every flow-admissible signed graph admits a nowhere-zero 11-flow.

Original languageEnglish
Pages (from-to)198-221
Number of pages24
JournalJournal of Combinatorial Theory. Series B
Volume149
DOIs
Publication statusPublished - Jul 2021
Externally publishedYes

Keywords

  • Balanced Z×Z-NZF
  • Integer flow
  • Modulo flow
  • Signed graph

Fingerprint

Dive into the research topics of 'Flows on flow-admissible signed graphs'. Together they form a unique fingerprint.

Cite this

DeVos, M., Li, J., Lu, Y., Luo, R., Zhang, C. Q., & Zhang, Z. (2021). Flows on flow-admissible signed graphs. Journal of Combinatorial Theory. Series B, 149, 198-221. https://doi.org/10.1016/j.jctb.2020.04.008