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 |
| _version_ | 1797871663532998656 |
|---|---|
| author | Hossein Hajiabolhassan Meysam Alishahi |
| author_facet | Hossein Hajiabolhassan Meysam Alishahi |
| author_sort | Hossein Hajiabolhassan |
| collection | DOAJ |
| description | 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 paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem. ./files/site1/files/61/4.pdf |
| first_indexed | 2024-04-10T00:47:26Z |
| format | Article |
| id | doaj.art-96117409603848a28ab6ac8b849f29a2 |
| institution | Directory Open Access Journal |
| issn | 2588-2546 2588-2554 |
| language | fas |
| last_indexed | 2024-04-10T00:47:26Z |
| publishDate | 2020-05-01 |
| publisher | Kharazmi University |
| record_format | Article |
| series | پژوهشهای ریاضی |
| spelling | doaj.art-96117409603848a28ab6ac8b849f29a22023-03-13T19:21:49ZfasKharazmi Universityپژوهشهای ریاضی2588-25462588-25542020-05-01613946On the Altermatic Number of GraphsHossein Hajiabolhassan0Meysam Alishahi1 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 paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem. ./files/site1/files/61/4.pdfhttp://mmr.khu.ac.ir/article-1-2638-en.htmlkneser graphschromatic number of graphsalternation number of graphs. |
| spellingShingle | Hossein Hajiabolhassan Meysam Alishahi On the Altermatic Number of Graphs پژوهشهای ریاضی kneser graphs chromatic number of graphs alternation number of graphs. |
| title | On the Altermatic Number of Graphs |
| title_full | On the Altermatic Number of Graphs |
| title_fullStr | On the Altermatic Number of Graphs |
| title_full_unstemmed | On the Altermatic Number of Graphs |
| title_short | On the Altermatic Number of Graphs |
| title_sort | on the altermatic number of graphs |
| topic | kneser graphs chromatic number of graphs alternation number of graphs. |
| url | http://mmr.khu.ac.ir/article-1-2638-en.html |
| work_keys_str_mv | AT hosseinhajiabolhassan onthealtermaticnumberofgraphs AT meysamalishahi onthealtermaticnumberofgraphs |