𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classes of Graphs that Are Not Vertex Ramsey

✍ Scribed by Kierstead, H. A.

Book ID
118197247
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
238 KB
Volume
10
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex-transitive graphs that are not Ca
Vertex-transitive graphs that are not Cayley graphs. II
✍ McKay, Brendan D.; Praeger, Cheryl E. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 881 KB

The Petersen graph on 10 vertices is the smallest example of a vertex-transitive graph that is not a Cayley graph. In 1983, D. MaruSiE asked, "For what values of n does there exist such a graph on n vertices?" We give several new constructions of families of vertex-transitive graphs that are not Cay

-Ramsey classes of graphs
-Ramsey classes of graphs
✍ MieczysΕ‚aw Borowiecki; Anna Fiedorowicz πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 243 KB
Vertex Ramsey Properties of Families of
Vertex Ramsey Properties of Families of Graphs
✍ Tomasz Łuczak; Andrzej RuciΕ„ski; Sebastian UrbaΕ„ski πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 118 KB

For graphs F, G 1 , ..., G r , we write F Q (G 1 , ..., G r ) if for every coloring of the vertices of F with r colors there exists i, i=1, 2, ..., r, such that a copy of G i is colored with the ith color. For two families of graphs G 1 , ..., G r and H 1 , ..., H s , by .., H s ) for every graph F