Premium
A generalization of Gale's lemma
Author(s) -
Alishahi Meysam,
Hajiabolhassan Hossein
Publication year - 2018
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22215
Subject(s) - lemma (botany) , mathematics , generalization , combinatorics , chromatic scale , graph , discrete mathematics , mathematical analysis , ecology , poaceae , biology
In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds forcoind( B 0 ( G ) ) + 1 andcoind ( B ( G ) ) + 2 , the two classic topological lower bounds for the chromatic number of a graph G .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom