altermatic
Describing a certain combinatorial lower bound of a chromatic number of a graphDescribing a certain combinatorial lower bound of a chromatic number of a graph.
UK/ˌɒl.təˈmæt.ɪk/US/ˌɔl.təɹˈmæt.ɪk/
Значення
значень: 1(без ступенів порівняння)Describing a certain combinatorial lower bound of a chromatic number of a graph.
Походження
Coined by mathematicians Meysam Alishahiand and Hossein Hajiabolhassan in 2014 for the 201Coined by mathematicians Meysam Alishahiand and Hossein Hajiabolhassan in 2014 for the 2015 paper "On the chromatic number of general Kneser hypergraphs" as a blend of alternating + chromatic on the grounds that the chromatic bound is given by a longest subsequence in which every pair of consecutive terms differs (loosely, the subsequence "alternates").
Wiktionary, CC BY-SA 4.0 · source