SIAMDM
2010
13 years 6 months ago
2010
Abstract. The conjecture of Bollob
CPC
2000
13 years 11 months ago
2000
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
JGT
2006
13 years 11 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
JCT
2006
13 years 11 months ago
2006
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
JCT
2008
13 years 11 months ago
2008
A conjecture by Bollob
DM
2006
13 years 11 months ago
2006
For n, k and t such that 1 < t < k < n, a set F of subsets of [n] has the (k, t)threshold property if every k-subset of [n] contains at least t sets from F and every (k -...
CCCG
2009
14 years 17 days ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
ESORICS
1994
Springer
14 years 3 months ago
1994
Springer
It has been observed that often the release of a limited part of an information resource poses no security risks, but the relase of a sufficiently large part of that resource might...
DEM
2001
Springer
14 years 4 months ago
2001
Springer
With the advances in rendering hardware, it is possible to render very complex scenes in real-time. In general, computers do not have enough memory to store all the necessary infor...
GECCO
2005
Springer
14 years 5 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....