An Erdos-Gallai conjecture for signed graphs
Combinatorics
2025-09-10 v1
Abstract
For every natural number , we show that the maximum negative girth among the class of signed graphs on vertices with balanced chromatic number at least is between and . 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}
}