753 search results - page 2 / 151 » Completing a (k - 1)-Assignment |
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
SIAMDM
2008
13 years 5 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
EJC
2007
13 years 5 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
CAIP
1997
Springer
13 years 9 months ago
1997
Springer
CORR
2004
Springer
13 years 5 months ago
2004
Springer
It is usually assumed that Honeynets are hard to detect and that attempts to detect or disable them can be unconditionally monitored. We scrutinize this assumption and demonstrate ...