# Ramsey Good Graphs with Long Suspended Paths

Ramsey Good Graphs with Long Suspended Paths A connected graph H with $$|H|\ge \sigma (G)$$ | H | ≥ σ ( G ) is said to be G-good if $$R(G,H)=(\chi (G)-1)(|H|-1)+\sigma (G)$$ R ( G , H ) = ( χ ( G ) - 1 ) ( | H | - 1 ) + σ ( G ) . For an integer $$\ell \ge 3$$ ℓ ≥ 3 , let $$P_\ell$$ P ℓ be a path of order $$\ell$$ ℓ , and $$H^{(\ell )}$$ H ( ℓ ) a graph obtained from H by joining the end vertices of $$P_\ell$$ P ℓ to distinct vertices u, v of H. It is widely known that for any graphs G and H, if $$\ell$$ ℓ is sufficiently large, then $$H^{(\ell )}$$ H ( ℓ ) is G-good. In this note, we show that there exists a constant $$c=c(\Delta )$$ c = c ( Δ ) such that for any graphs G and H with $$\Delta (G)\le \Delta$$ Δ ( G ) ≤ Δ and $$\Delta (H)\le \Delta$$ Δ ( H ) ≤ Δ , if $$\ell \ge c\cdot (|G|+|H|)$$ ℓ ≥ c · ( | G | + | H | ) , then $$H^{(\ell )}$$ H ( ℓ ) is G-good; and if $$n\ge 2\alpha (G)+\Delta ^2(G)+4$$ n ≥ 2 α ( G ) + Δ 2 ( G ) + 4 , then $$P_n$$ P n is G-good. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Graphs and Combinatorics Springer Journals

# Ramsey Good Graphs with Long Suspended Paths

Graphs and Combinatorics, Volume 34 (4) – Jun 6, 2018
9 pages

/lp/springer-journals/ramsey-good-graphs-with-long-suspended-paths-le9tnnNqhy
Publisher
Springer Journals
Subject
Mathematics; Combinatorics; Engineering Design
ISSN
0911-0119
eISSN
1435-5914
DOI
10.1007/s00373-018-1910-z
Publisher site
See Article on Publisher Site

### Abstract

A connected graph H with $$|H|\ge \sigma (G)$$ | H | ≥ σ ( G ) is said to be G-good if $$R(G,H)=(\chi (G)-1)(|H|-1)+\sigma (G)$$ R ( G , H ) = ( χ ( G ) - 1 ) ( | H | - 1 ) + σ ( G ) . For an integer $$\ell \ge 3$$ ℓ ≥ 3 , let $$P_\ell$$ P ℓ be a path of order $$\ell$$ ℓ , and $$H^{(\ell )}$$ H ( ℓ ) a graph obtained from H by joining the end vertices of $$P_\ell$$ P ℓ to distinct vertices u, v of H. It is widely known that for any graphs G and H, if $$\ell$$ ℓ is sufficiently large, then $$H^{(\ell )}$$ H ( ℓ ) is G-good. In this note, we show that there exists a constant $$c=c(\Delta )$$ c = c ( Δ ) such that for any graphs G and H with $$\Delta (G)\le \Delta$$ Δ ( G ) ≤ Δ and $$\Delta (H)\le \Delta$$ Δ ( H ) ≤ Δ , if $$\ell \ge c\cdot (|G|+|H|)$$ ℓ ≥ c · ( | G | + | H | ) , then $$H^{(\ell )}$$ H ( ℓ ) is G-good; and if $$n\ge 2\alpha (G)+\Delta ^2(G)+4$$ n ≥ 2 α ( G ) + Δ 2 ( G ) + 4 , then $$P_n$$ P n is G-good.

### Journal

Graphs and CombinatoricsSpringer Journals

Published: Jun 6, 2018

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create folders to

Export folders, citations