On graphs with a large chromatic number that contain no small odd cycles (Q1930215): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring graphs with locally small chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869375 / rank
 
Normal rank

Latest revision as of 02:37, 6 July 2024

scientific article
Language Label Description Also known as
English
On graphs with a large chromatic number that contain no small odd cycles
scientific article

    Statements

    On graphs with a large chromatic number that contain no small odd cycles (English)
    0 references
    0 references
    0 references
    10 January 2013
    0 references
    small odd cycles
    0 references

    Identifiers