✦ LIBER ✦

A proof of unimodality on the numbers of connected spanning subgraphs in an -vertex graph with at least edges

✍ Scribed by Peng Cheng; Shigeru Masuyama

Book ID: 108112855
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 721 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.11.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of certain subgraphs conta

On the number of certain subgraphs contained in graphs with a given number of edges

✍ Noga Alon 📂 Article 📅 1986 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 666 KB

An approximation algorithm for finding a

An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB

Tight upper bound on the number of edges

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

✍ Zhi-Zhong Chen; Shiqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo

MAGNA CARTAThe Great CharterPreamble

📂 Fiction 🌐 English ⚖ 11 KB 👁 18 views