✦ LIBER ✦

The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers

✍ Scribed by Yusheng Li; Wenan Zang

Book ID: 111592073
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 110 KB
Volume: 7
Category: Article
ISSN: 1382-6905
DOI: 10.1023/b:joco.0000017383.13275.17

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

Ramsey Numbers and the Size of Graphs

✍ Sudakov, Benny 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 151 KB

On the Ramsey number of trees versus gra

On the Ramsey number of trees versus graphs with large clique number

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

The Ramsey number of a graph with bounde

The Ramsey number of a graph with bounded maximum degree

✍ C Chvatál; V Rödl; E Szemerédi; W.T Trotter Jr. 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Estimates of the number of independent s

Estimates of the number of independent sets in graphs with a fixed independence number

✍ A. B. Dainyak 📂 Article 📅 2009 🏛 Allerton Press, Inc. 🌐 English ⚖ 158 KB

On the Maximum Number of Independent Cyc

On the Maximum Number of Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Let G=(V 1 , V 2 ; E ) be a bipartite graph with |V 1 |= |V 2 | =n 2k, where k is a positive integer. Suppose that the minimum degree of G is at least k+1. We show that if n>2k, then G contains k vertex-disjoint cycles. We also show that if n=2k, then G contains k&1 quadrilaterals and a path of orde