New bounds on clique-chromatic numbers of Johnson graphs
From MaRDI portal
Publication:2192124
DOI10.1016/J.DAM.2020.01.015zbMATH Open1442.05068OpenAlexW3001464251MaRDI QIDQ2192124FDOQ2192124
Andrei M. Raigorodskii, Mikhail M. Koshelev
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.015
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection theorems with geometric consequences
- The Borsuk partition problem: the seventieth anniversary
- Around Borsuk's hypothesis
- A counterexample to Borsuk’s conjecture
- Perfect graphs of arbitrarily large clique-chromatic number
- The number of edges in induced subgraphs of some distance graphs
- Clique-transversal sets of line graphs and complements of line graphs
- 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
- Clique chromatic numbers of intersection graphs
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On lower bounds for the chromatic number of spheres
- Families of sets with no matchings of sizes 3 and 4
- Partition‐free families of sets
- Panchromatic 3-colorings of random hypergraphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Counterexamples to Borsuk's conjecture with large girth
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
Cited In (17)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- On stability of the independence number of a certain distance graph
- Exact modularity of line graphs of complete graphs
- Covering planar sets
- 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
- Decomposition of the Johnson graphs into graph-pairs of order 4
- On the independence number and the chromatic number of generalized preferential attachment models
- Lower bounds on the clique-chromatic numbers of some distance graphs
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- New Turán type bounds for Johnson graphs
- Bounds on Borsuk numbers in distance graphs of a special type
- Random cyclic triangle-free graphs of prime order
- Interview with Andrei Raigorodskii
- New lower bound on the modularity of Johnson graphs
- Estimate of the number of edges in subgraphs of a Johnson graph
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)
