Name
Abstract | ||
|---|---|---|
Let G be a simple graph on n vertices. Let H be either the complete graph K-m or the complete bipartite graph K-r,K-s on a subset of the vertices in G. We show that G contains H as a subgraph if and only if beta(1,alpha)(H) <= beta(1,alpha) (G) for all i >= 0 and alpha is an element of Z(n). In fact, it suffices to consider only the first syzygy module. In particular, we prove that,31, (H) <,31, (G) for all it alpha is an element of Z(n) if and only if G contains a subgraph that is isomorphic to either H or a multipartite graph K-2,K-...,K-2,(a,b). |
Year | Venue | Field |
|---|---|---|
2015 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Complete bipartite graph,Graph,Discrete mathematics,Topology,Complete graph,Combinatorics,Betti number,Vertex (geometry),Syzygy (astronomy),Isomorphism,Multipartite graph,Mathematics |
DocType | Volume | ISSN |
Journal | 63 | 2202-3518 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huy Tài Hà | 1 | 11 | 3.96 |
| duc ho | 2 | 0 | 0.34 |