New bounds for the clique-chromatic numbers of Johnson graphs
From MaRDI portal
Publication:2243705
DOI10.1134/S1064562420010184zbMath1477.05079OpenAlexW3026920247MaRDI QIDQ2243705
Mikhail M. Koshelev, Andrei M. Raigorodskii
Publication date: 11 November 2021
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562420010184
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)
Related Items (7)
Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Exact modularity of line graphs of complete graphs ⋮ New lower bound on the modularity of Johnson graphs ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ Covering planar sets ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Intersection theorems with geometric consequences
- Families of sets with no matchings of sizes 3 and 4
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On lower bounds for the chromatic number of spheres
- Clique chromatic numbers of intersection graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- The number of edges in induced subgraphs of some distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Panchromatic 3-colorings of random hypergraphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Partition‐free families of sets
This page was built for publication: New bounds for the clique-chromatic numbers of Johnson graphs
