New bounds on clique-chromatic numbers of Johnson graphs (Q2192124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Clique coloring of dense random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-transversal sets of line graphs and complements of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the Maximal Cliques of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring clique-hypergraphs of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Coloring Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs of arbitrarily large clique-chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small \(n\)-uniform hypergraphs with positive discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-coloring some classes of odd-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4623033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of sets with no matchings of sizes 3 and 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition‐free families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for the chromatic number of spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to Borsuk's conjecture with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges in induced subgraphs of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk partition problem: the seventieth anniversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Around Borsuk's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panchromatic 3-colorings of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique chromatic numbers of intersection graphs / rank
 
Normal rank

Revision as of 23:45, 22 July 2024

scientific article
Language Label Description Also known as
English
New bounds on clique-chromatic numbers of Johnson graphs
scientific article

    Statements

    New bounds on clique-chromatic numbers of Johnson graphs (English)
    0 references
    29 June 2020
    0 references
    clique-chromatic numbers
    0 references
    Johnson graphs
    0 references
    Ramsey numbers
    0 references
    0 references
    0 references
    0 references

    Identifiers