GC
2011
Springer
12 years 8 months ago
2011
Springer
GC
2011
Springer
12 years 8 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
GC
2011
Springer
12 years 8 months ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
GC
2011
Springer
12 years 8 months ago
2011
Springer
GC
2011
Springer
12 years 8 months ago
2011
Springer
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
GC
2011
Springer
12 years 11 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
GC
2011
Springer
12 years 11 months ago
2011
Springer
GC
2011
Springer
12 years 11 months 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,...
GC
2011
Springer
12 years 11 months ago
2011
Springer