✦ LIBER ✦

The poset on connected induced subgraphs of a graph need not be Sperner

✍ Scribed by Michael S. Jacobson; André E. Kézdy; Steve Seif

Publisher: Springer Netherlands
Year: 1995
Tongue: English
Weight: 224 KB
Volume: 12
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf01111746

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of distinct induced subgra

On the number of distinct induced subgraphs of a graph

✍ P. Erdős; A. Hajnal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 KB

On the number of induced subgraphs of a

On the number of induced subgraphs of a random graph

✍ Hiroshi Maehara 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A bound on the chromatic number of graph

A bound on the chromatic number of graphs without certain induced subgraphs

✍ Stanley Wagon 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 144 KB

On the maximum induced forests of a conn

On the maximum induced forests of a connected cubic graph without triangles

✍ Maolin Zheng; Xiaoyun Lu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Let t(G) denote the cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that r(G) 3 2n/3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. [l]. Using this

Appropriate discounting of future utilit

Appropriate discounting of future utilities need not be the dictatorship of the present: A note on Chichilnisky

✍ Yew-Kwang Ng 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 205 KB

Problem 141. : The genus of a Cayley gra

Problem 141. : The genus of a Cayley graph is the smallest genus of any surface on which the graph can be imbedded. The genus of a group G is the smallest genus of all connected Cayley graphs on G. Is it true that for each genus g, there is a group of genus g?

📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 69 KB

acceptable if they are not as widely known as they deserve.