This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vond...
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...
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 -...
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...
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...
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...
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....