Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512204 | Discrete Mathematics | 2005 | 14 Pages |
Abstract
We show that our result is best possible in the following sense. Specifically, we prove that for every non-simple graph F there exist a graph G and a homogeneous set W of G such that W induces a subgraph isomorphic to F and Ext(G) is infinite.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Igor' Zverovich,