Lower bounds on the clique-chromatic numbers of some distance graphs

DOI10.2140/MOSCOW.2021.10.141zbMATH Open1469.05057OpenAlexW3175599215WikidataQ114045344 ScholiaQ114045344MaRDI QIDQ2043671FDOQ2043671

Authors: Mikhail M. Koshelev 

Publication date: 3 August 2021

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2021.10.141

Recommendations

• New bounds for the clique-chromatic numbers of Johnson graphs
• New bounds on clique-chromatic numbers of Johnson graphs
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• Lower bounds for the clique and the chromatic numbers of a graph

zbMATH Keywords

Johnson graphsfinite projective planeclique-chromatic numbers

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Intersection theorems with geometric consequences
• The Borsuk partition problem: the seventieth anniversary
• A counterexample to Borsuk’s conjecture
• Title not available (Why is that?)
• Perfect graphs of arbitrarily large clique-chromatic number
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Clique-transversal sets of line graphs and complements of line graphs
• An improved bound for the stepping-up lemma
• Title not available (Why is that?)
• Coloring the Maximal Cliques of Graphs
• Colouring clique-hypergraphs of circulant graphs
• Clique-coloring some classes of odd-hole-free graphs
• Clique-coloring circular-arc graphs
• Clique coloring of dense random graphs
• Title not available (Why is that?)
• Sharp results concerning disjoint cross-intersecting families
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• Families of sets with no matchings of sizes 3 and 4
• Partition-free families of sets
• Panchromatic 3-colorings of random hypergraphs
• New bounds on clique-chromatic numbers of Johnson graphs
• On the independence number and the chromatic number of generalized preferential attachment models
• New bounds for the clique-chromatic numbers of Johnson graphs
• On small \(n\)-uniform hypergraphs with positive discrepancy
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

Cited In (3)

• Lower bounds for the clique and the chromatic numbers of a graph
• New bounds on clique-chromatic numbers of Johnson graphs
• New bounds for the clique-chromatic numbers of Johnson graphs

This page was built for publication: Lower bounds on the clique-chromatic numbers of some distance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043671)