Odd complete bipartite minors in graphs with independence number two
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909602939928576 |
|---|---|
| author | Chen, Rong Deng, Zijian |
| author_facet | Chen, Rong Deng, Zijian |
| contents | Recently, Chen and Deng have proved that every graph $G$ with independence number two contains $K_{\ell,χ(G)- \ell}$ as a minor for each integer $\ell$ with $1\leq\ell < χ(G)$. In this paper, we extend this result to odd minor version. That is, we prove that each graph $G$ with independence number two contains $K_{\ell,χ(G)- \ell}$ as an odd minor for each integer $\ell$ with $1\leq\ell < χ(G)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_03851 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Odd complete bipartite minors in graphs with independence number two Chen, Rong Deng, Zijian Combinatorics 05C15, 05C83 Recently, Chen and Deng have proved that every graph $G$ with independence number two contains $K_{\ell,χ(G)- \ell}$ as a minor for each integer $\ell$ with $1\leq\ell < χ(G)$. In this paper, we extend this result to odd minor version. That is, we prove that each graph $G$ with independence number two contains $K_{\ell,χ(G)- \ell}$ as an odd minor for each integer $\ell$ with $1\leq\ell < χ(G)$. |
| title | Odd complete bipartite minors in graphs with independence number two |
| topic | Combinatorics 05C15, 05C83 |
| url | https://arxiv.org/abs/2505.03851 |