English

An Erdos-Gallai conjecture for signed graphs

Combinatorics 2025-09-10 v1

Abstract

For every natural number pp, we show that the maximum negative girth among the class of signed graphs on nn vertices with balanced chromatic number at least pp is between (1/e)n1/(p1)(1/e)n^{1/(p-1)} and 2(p1)n1/(p1)2(p-1) n^{1/(p-1)}. This extends a conjecture of Erd\H{o}s and Gallai to signed graphs.

Keywords

Cite

@article{arxiv.2509.07724,
  title  = {An Erdos-Gallai conjecture for signed graphs},
  author = {Lujia Wang},
  journal= {arXiv preprint arXiv:2509.07724},
  year   = {2025}
}
R2 v1 2026-07-01T05:28:24.335Z