✦ LIBER ✦

An extremal problem on group connectivity of graphs

✍ Scribed by Rong Luo; Rui Xu; Gexin Yu

Book ID: 113582458
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 243 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.01.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal problem on the connectivity

An extremal problem on the connectivity of graphs

✍ Qi-Mei He 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

An extremal problem on Kr-free graphs

✍ Peter Frankl; János Pach 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

Let r, t 2 2 be integers and c a constant, 0 < c 5 ( r -2 ) / ( r -1). Suppose that G is a &-free graph on n vertices in which any t distinct vertices have at most cn common neighbors. Here an asymptotically best bound is obtained for the maximal number of edges in such graphs. This solves a problem

An Extremal Problem on Contractible Edge

An Extremal Problem on Contractible Edges in 3-Connected Graphs

✍ Joe Anderson; Haidong Wu 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 125 KB

An Extremal Problem on Degree Sequences

An Extremal Problem on Degree Sequences of Graphs

✍ Nathan Linial; Eyal Rozenman 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 116 KB

On Group Connectivity of Graphs

✍ Hong-Jian Lai; Rui Xu; Ju Zhou 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 133 KB

An extremal problem for 3-graphs

✍ P. Frankl 📂 Article 📅 1978 🏛 Akadmiai Kiad 🌐 English ⚖ 241 KB