Join Our Newsletter

COMBINATORICA

2010

11 years 2 months ago
2010

For each k 2, let k (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (k + o(1)) n k edges as n . We pro...

JCT

2007

11 years 5 months ago
2007

The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...

GC

2007

Springer

11 years 5 months ago
2007

Springer

Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iﬀ the corresponding n-tuples diﬀer in exactly one posit...

JCT

2006

11 years 5 months ago
2006

Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...

CIG

2006

IEEE

11 years 11 months ago
2006

IEEE

—The ChessBrain project currently holds an official Guinness World Record for the largest number of computers used to play one single game of chess. In this paper, we cover the l...