✦ LIBER ✦

Lower bounds for independence numbers of some locally sparse graphs

✍ Scribed by Li, Yusheng; Lin, Qizhong

Book ID: 120694233
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 166 KB
Volume: 28
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9578-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Lower Bounds for the Independence Nu

New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs

✍ Dutta, Kunal; Mubayi, Dhruv; Subramanian, C. R. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 212 KB

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

Lower bounds for the independence number

Lower bounds for the independence numbers of some distance graphs with vertices in {−1, 0, 1}n

✍ V. K. Lyubimov; A. M. Raigorodskii 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 183 KB

Spectral bounds for the clique and indep

Spectral bounds for the clique and independence numbers of graphs

✍ Herbert S Wilf 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Laplacian spectral bounds for clique and

Laplacian spectral bounds for clique and independence numbers of graphs

✍ Mei Lu; Huiqing Liu; Feng Tian 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 118 KB

A lower bound for the independence numbe

A lower bound for the independence number of a planar graph

✍ Michael O Albertson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 403 KB