✦ LIBER ✦

Many large eigenvalues in sparse graphs

✍ Scribed by Mohar, Bojan

Book ID: 120335064
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 357 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.03.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse random graphs: Eigenvalues and ei

Sparse random graphs: Eigenvalues and eigenvectors

✍ Linh V. Tran; Van H. Vu; Ke Wang 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

Large holes in sparse random graphs

✍ A. M. Frieze; B. Jackson 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 353 KB

Large induced forests in sparse graphs

✍ Noga Alon; Dhruv Mubayi; Robin Thomas 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract For a graph __G__, let __a__(__G__) denote the maximum size of a subset of vertices that induces a forest. Suppose that __G__ is connected with __n__ vertices, __e__ edges, and maximum degree Δ. Our results include: (a) if Δ ≤ 3, and __G__ ≠ __K__~4~, then __a__(__G__) ≥ __n__ − e/4 − 1

Large induced trees in sparse random gra

Large induced trees in sparse random graphs

✍ A.M Frieze; B Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Sparse Hessenberg reduction and the eige

Sparse Hessenberg reduction and the eigenvalue problem for large sparse matrices

✍ Papathomas, T.; Wing, O. 📂 Article 📅 1976 🏛 IEEE ⚖ 689 KB

On large matchings and cycles in sparse

On large matchings and cycles in sparse random graphs

✍ A.M Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Let k be a fixed positive integer. A graph H has property Mk if it contains [½k] edge disjoint hamilton cycles plus a further edge disjoint matching which leaves at most one vertex isolated, if k is odd. Let p = c/n, where c is a large enough constant. We show that G,,p a.s. contains a vertex induce