183 search results - page 1 / 37 » Complete Minors and Independence Number |
SIAMDM
2010
13 years 1 days ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
JGT
2007
13 years 5 months ago
2007
ENDM
2007
13 years 5 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
ECOOP
1993
Springer
13 years 9 months ago
1993
Springer
Object-oriented programming promises to increase programmer productivity through better reuse of existing code. However, reuse is not yet pervasive in today’s object-oriented pro...
GC
2011
Springer
13 years 8 days ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...