Achromatic numbers of Kneser graphs

DOI10.26493/1855-3974.2357.373zbMath1479.05090arXiv2003.09409OpenAlexW3152754356MaRDI QIDQ5013343

Christian Rubio-Montiel, Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño

Publication date: 30 November 2021

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.09409

zbMATH Keywords

achromatic numberblock designspseudoachromatic numberGrundy numbergeometric type Kneser graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric achromatic and pseudoachromatic indices
• The achromatic number of Kneser graphs
• Kneser's conjecture, chromatic number, and homotopy
• Geometric graphs with no three disjoint edges
• The equitable colorings of Kneser graphs
• On the b-chromatic number of Kneser graphs
• Local coloring of Kneser graphs
• On resolvable designs \(S_ 3(3;4,v)\)
• Balanced incomplete block designs and related designs
• The b-chromatic number of a graph
• The existence of simple \(S_ 3(3,4,\nu)\)
• Decomposing \(K_{n} \cup P\) into triangles
• On the chromatic number of some geometric type Kneser graphs
• Equitable coloring of Kneser graphs
• On Sets of Distances of n Points
• Proofs from THE BOOK

This page was built for publication: Achromatic numbers of Kneser graphs