Name
Abstract | ||
|---|---|---|
A graph G is said to be K2;3-saturated if G contains no copy of K2;3 as a subgraph, but for any edge e in the complement of G the graph G + e does contain a copy of K2;3. The minimum number of edges of a K2;2- saturated graph of given order n was precisely determined by Ollmann in 1972. Here, we determine the asymptotic behavior for the minimum number of edges in a K2;3-saturated graph. |
Year | Venue | Keywords |
|---|---|---|
2008 | Australasian J. Combinatorics | asymptotic behavior |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Line graph,Edge-transitive graph,Graph power,Graph factorization,Null graph,Factor-critical graph,Graph minor,Mathematics,Complement graph | Journal | 40 |
Citations | PageRank | References |
4 | 0.61 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Pikhurko | 1 | 318 | 47.03 |
| John Schmitt | 2 | 13 | 1.41 |