Lower bounds on the clique-chromatic numbers of some distance graphs
type: Item
instance of: scholarly article
title: Lower bounds on the clique-chromatic numbers of some distance graphs
zbMATH Open document ID: 1469.05057
author: Mikhail M. Koshelev
published in: Moscow Journal of Combinatorics and Number Theory
publication date: 2021-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7377524
zbMATH Keywords: clique-chromatic numbers
zbMATH Keywords: Johnson graphs
zbMATH Keywords: finite projective plane
MaRDI profile type: Publication
full work available at URL: moscow.2021.10.141
OpenAlex ID: W3175599215
Wikidata QID: Q114045344
cites work: Clique coloring of dense random graphs
cites work: Clique-transversal sets of line graphs and complements of line graphs
cites work: Coloring the Maximal Cliques of Graphs
cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
cites work: Colouring clique-hypergraphs of circulant graphs
cites work: Clique-coloring circular-arc graphs
cites work: Perfect graphs of arbitrarily large clique-chromatic number
cites work: On small \(n\)-uniform hypergraphs with positive discrepancy
cites work: An improved bound for the stepping-up lemma
cites work: Clique-coloring some classes of odd-hole-free graphs
cites work: Combinatorial Theorems on Classifications of Subsets of a Given Set
cites work: Q4623033
cites work: Families of sets with no matchings of sizes 3 and 4
cites work: Partition‐free families of sets
cites work: Sharp results concerning disjoint cross-intersecting families
cites work: Intersection theorems with geometric consequences
cites work: A counterexample to Borsuk’s conjecture
cites work: On the independence number and the chromatic number of generalized preferential attachment models
cites work: Panchromatic 3-colorings of random hypergraphs
cites work: Q4146667
cites work: The Borsuk partition problem: the seventieth anniversary
cites work: Q5431025
cites work: New bounds for the clique-chromatic numbers of Johnson graphs
cites work: New bounds on clique-chromatic numbers of Johnson graphs
cites work: On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
DOI: 10.2140/MOSCOW.2021.10.141
description: scientific article; zbMATH DE number 7377524