On graphs with a large chromatic number that contain no small odd cycles (Q1930215): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114225276, #quickstatements; #temporary_batch_1709550817224 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3099674273 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1201.3271 / rank | |||
Normal rank | |||
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 01: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
10 January 2013
0 references
small odd cycles
0 references
0 references