A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph

DOI10.1016/0012-365X(78)90186-3zbMath0388.05036OpenAlexW2113835179MaRDI QIDQ1250115

Vojtěch Rödl, Jaroslav Nešetřil

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90186-3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (17)

Note on strong product graph dimension ⋮ Ultrafilters on \(\omega\) and atoms in the lattice of uniformities. II ⋮ Graphs of small dimensions ⋮ Product dimension of forests and bounded treewidth graphs ⋮ Complexity of dimension three and some related edge-covering characteristics of graphs ⋮ Edge-intersection graphs of boundary-generated paths in a grid ⋮ Unnamed Item ⋮ Simple proof of the existence of restricted Ramsey graphs by means of a partite construction ⋮ Orthogonal partitions and covering of graphs ⋮ Unnamed Item ⋮ On the dimension of trees ⋮ A note on dimension of $P^n_3$ ⋮ On induced and isometric embeddings of graphs into the strong product of paths ⋮ A class of dimension-skipping graphs ⋮ Dimension of the sum of several copies of a graph ⋮ Induced Embeddings into Hamming Graphs. ⋮ A surprising permanence of old motivations (a not-so-rigid story)

Cites Work

• Regularity and Positional Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph