New bounds on clique-chromatic numbers of Johnson graphs
From MaRDI portal
Publication:2192124
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 7024788 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Around Borsuk's hypothesis
- Clique chromatic numbers of intersection graphs
- Clique coloring of dense random graphs
- Clique-coloring circular-arc graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Coloring the Maximal Cliques of Graphs
- Colouring clique-hypergraphs of circulant graphs
- Counterexamples to Borsuk's conjecture with large girth
- Families of sets with no matchings of sizes 3 and 4
- Intersection theorems with geometric consequences
- On lower bounds for the chromatic number of spheres
- On small \(n\)-uniform hypergraphs with positive discrepancy
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Panchromatic 3-colorings of random hypergraphs
- Partition-free families of sets
- Perfect graphs of arbitrarily large clique-chromatic number
- The Borsuk partition problem: the seventieth anniversary
- The number of edges in induced subgraphs of some distance graphs
- Three lectures on the Borsuk partition problem
Cited in
(22)- Random cyclic triangle-free graphs of prime order
- Graphs with large clique-chromatic numbers
- Lower bounds on the clique-chromatic numbers of some distance graphs
- More results on clique-chromatic numbers of graphs with no long path
- Covering planar sets
- New lower bound on the modularity of Johnson graphs
- Exact modularity of line graphs of complete graphs
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- New Turán type bounds for Johnson graphs
- Tight bounds on the clique chromatic number
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
- Estimate of the number of edges in subgraphs of a Johnson graph
- Decomposition of the Johnson graphs into graph-pairs of order 4
- Clique chromatic numbers of intersection graphs
- Bounds on Borsuk numbers in distance graphs of a special type
- On the independence number and the chromatic number of generalized preferential attachment models
- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On stability of the independence number of a certain distance graph
- Interview with Andrei Raigorodskii
- New bounds for the clique-chromatic numbers of Johnson graphs
This page was built for publication: New bounds on clique-chromatic numbers of Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192124)
