A generalization of Gale's lemma

Meysam Alishahi, Hossein Hajiabolhassan*

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

119 Downloads (Pure)

Abstract

In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for coind (B0(G)) + 1 andcoind(B(G)) + 2, the two classic topological lower boundsfor the chromatic number of a graph G.
Original languageEnglish
JournalJournal of Graph Theory
Volume88
Issue number2
Pages (from-to)337-346
ISSN0364-9024
DOIs
Publication statusPublished - 2017

Keywords

  • Box complex
  • Chromatic number of graphs
  • Gale's lemma

Cite this

Alishahi, M., & Hajiabolhassan, H. (2017). A generalization of Gale's lemma. Journal of Graph Theory, 88(2), 337-346. https://doi.org/10.1002/jgt.22215
Alishahi, Meysam ; Hajiabolhassan, Hossein. / A generalization of Gale's lemma. In: Journal of Graph Theory. 2017 ; Vol. 88, No. 2. pp. 337-346.
@article{fd838f1ff93a4e46b5f835cc4ec57593,
title = "A generalization of Gale's lemma",
abstract = "In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for coind (B0(G)) + 1 andcoind(B(G)) + 2, the two classic topological lower boundsfor the chromatic number of a graph G.",
keywords = "Box complex, Chromatic number of graphs, Gale's lemma",
author = "Meysam Alishahi and Hossein Hajiabolhassan",
year = "2017",
doi = "10.1002/jgt.22215",
language = "English",
volume = "88",
pages = "337--346",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "JohnWiley & Sons, Inc.",
number = "2",

}

Alishahi, M & Hajiabolhassan, H 2017, 'A generalization of Gale's lemma', Journal of Graph Theory, vol. 88, no. 2, pp. 337-346. https://doi.org/10.1002/jgt.22215

A generalization of Gale's lemma. / Alishahi, Meysam; Hajiabolhassan, Hossein.

In: Journal of Graph Theory, Vol. 88, No. 2, 2017, p. 337-346.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - A generalization of Gale's lemma

AU - Alishahi, Meysam

AU - Hajiabolhassan, Hossein

PY - 2017

Y1 - 2017

N2 - In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for coind (B0(G)) + 1 andcoind(B(G)) + 2, the two classic topological lower boundsfor the chromatic number of a graph G.

AB - In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for coind (B0(G)) + 1 andcoind(B(G)) + 2, the two classic topological lower boundsfor the chromatic number of a graph G.

KW - Box complex

KW - Chromatic number of graphs

KW - Gale's lemma

U2 - 10.1002/jgt.22215

DO - 10.1002/jgt.22215

M3 - Journal article

VL - 88

SP - 337

EP - 346

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -