✦ LIBER ✦

A Ramsey-type theorem for traceable graphs

✍ Scribed by F Galvin; I Rival; B Sands

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 458 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90053-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey-Type Theorems for Spatial Graphs

Ramsey-Type Theorems for Spatial Graphs and Good Drawings

✍ Seiya Negami 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 336 KB

We shall prove that for any spatial graph H, there exists a pair of natural numbers (N, M) such that any spatial embedding of the complete bipartite graph K N, M whose projection is a good drawing on the plane contains a subgraph which is ambient isotopic to a subdivision of H. ## 1998 Academic Pre

Topological Ramsey Theorem for Complete

Topological Ramsey Theorem for Complete Bipartite Graphs

✍ M.S. Miyauchi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A dirac-type theorem for squares of grap

A dirac-type theorem for squares of graphs

✍ Tomasz Traczyk Jr. 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

We prove that if G is a connected graph with p vertices and minimum degree greater than max( p/4 -1,3) then G2 is pancyclic. The result is best possible of its kind.

A generalization of a Ramsey-type theore

A generalization of a Ramsey-type theorem on hypermatchings

✍ Paul Baginski 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Abstract For an __r__‐uniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; ℤ~__n__~)) as the smallest integer for which there exists an __r__‐uniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; ℤ~__n__~)) vertices with clique(__H__) < __l__ such that eve

Generalized Ramsey theory for graphs IV,

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

✍ F. Harary; G. Prins 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

A Ramsey property for graph invariants

✍ Fred Buckley 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

## Abstract We consider the problem of which graph invariants have a certain property relating to Ramsey's theorem. Invariants which have this property are called Ramsey functions. We examine properties of chains of graphs associated with Ramsey functions. Methods are developed which enable one to