Simple proof of the existence of restricted Ramsey graphs by means of a partite construction (Q1167185): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Ramsey property for graphs with forbidden complete subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A short proof of the existence of highly chromatic hypergraphs without short cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph / rank | |||
Normal rank | |||
Revision as of 16:24, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple proof of the existence of restricted Ramsey graphs by means of a partite construction |
scientific article |
Statements
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction (English)
0 references
1981
0 references
induced monochromatic subgraph
0 references
clique number
0 references
