✦ LIBER ✦

Ramsey theory for graph connectivity

✍ Scribed by David W. Matula

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 335 KB
Volume: 7
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190070113

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

All triangle-graph ramsey numbers for co

All triangle-graph ramsey numbers for connected graphs of order six

✍ R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

## Abstract The Ramsey numbers __r(K__~3′~ __G__) are determined for all connected graphs __G__ of order six.

Generalized ramsey theory for graphs VII

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks

✍ F. Harary; A. J. Schwenk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

Graph Ramsey Theory and the Polynomial H

Graph Ramsey Theory and the Polynomial Hierarchy

✍ Marcus Schaefer 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 402 KB

In the Ramsey theory of graphs F Ä (G, H) means that for every way of coloring the edges of F red and blue F will contain either a red G or a blue H. Arrowing, the problem of deciding whether F Ä (G, H), lies in 6 p 2 =coNP NP and it was shown to be coNP-hard by Burr [Bur90]. We prove that Arrowing

Landscape connectivity: A conservation a

Landscape connectivity: A conservation application of graph theory

✍ A.G Bunn; D.L Urban; T.H Keitt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 427 KB

We use focal-species analysis to apply a graph-theoretic approach to landscape connectivity in the Coastal Plain of North Carolina. In doing so we demonstrate the utility of a mathematical graph as an ecological construct with respect to habitat connectivity. Graph theory is a well established mains

Finite Induced Graph Ramsey Theory: On P

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs

✍ D.S. Gunderson; V. Rodl; N.W. Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 425 KB

For given finite (unordered) graphs \(G\) and \(H\), we examine the existence of a Ramsey graph \(F\) for which the strong Ramsey arrow \(F \rightarrow(G)_{r}^{\prime \prime}\) holds. We concentrate on the situation when \(H\) is not a complete graph. The set of graphs \(G\) for which there exists a