An Erdos-Gallai conjecture for signed graphs
Abstract
For every natural number p, we show that the maximum negative girth among the class of signed graphs on n vertices with balanced chromatic number at least p is between (1/e)n1/(p-1) and 2(p-1) n1/(p-1). This extends a conjecture of Erdos and Gallai to signed graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.