Ramsey numbers for sparse graphs (Q1584253): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4075489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with linearly bounded Ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ramsey number of a graph with bounded maximum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5689012 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4200109 / rank | |||
Normal rank |
Latest revision as of 16:04, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ramsey numbers for sparse graphs |
scientific article |
Statements
Ramsey numbers for sparse graphs (English)
0 references
2 November 2000
0 references
sparse graphs
0 references
Ramsey number
0 references
0 references