An Erdos-Gallai conjecture for signed graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911144845770752 |
|---|---|
| author | Wang, Lujia |
| author_facet | Wang, Lujia |
| contents | 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)n^{1/(p-1)}$ and $2(p-1) n^{1/(p-1)}$. This extends a conjecture of Erdős and Gallai to signed graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_07724 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Erdos-Gallai conjecture for signed graphs Wang, Lujia Combinatorics 05C15, 05C22, 05C38 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)n^{1/(p-1)}$ and $2(p-1) n^{1/(p-1)}$. This extends a conjecture of Erdős and Gallai to signed graphs. |
| title | An Erdos-Gallai conjecture for signed graphs |
| topic | Combinatorics 05C15, 05C22, 05C38 |
| url | https://arxiv.org/abs/2509.07724 |