On the Altermatic Number of Graphs
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this pape...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Kharazmi University
2020-05-01
|
| Series: | پژوهشهای ریاضی |
| Subjects: | |
| Online Access: | http://mmr.khu.ac.ir/article-1-2638-en.html |