Name
Abstract | ||
|---|---|---|
Let H be some fixed graph. We call a graph Gvicarious for H if G is maximal H-free and, for every edge e of G, there is an edge f not in G such that G − e + f is also H-free. We demonstrate various properties of vicarious graphs and several examples are given. It is conjectured that a graph of order n which is vicarious for K3 has size at most (1/4 + o(1))(). |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1017/S096354830999054X | Combinatorics, Probability & Computing |
Keywords | DocType | Volume |
various property,order n,vicarious graph,fixed graph,edge e,maximal H-free,graph Gvicarious | Journal | 19 |
Issue | Citations | PageRank |
5-6 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |
| Andrew Thomason | 2 | 71 | 16.01 |