Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMBINATORICA
2010
11 years 2 months ago
Hypergraphs with independent neighborhoods
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...
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pik...
JCT
2007
95views more  JCT 2007»
11 years 5 months ago
Codegree problems for projective geometries
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...
Peter Keevash, Yi Zhao
GC
2007
Springer
11 years 5 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
JCT
2006
93views more  JCT 2006»
11 years 5 months ago
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
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...
József Balogh, Peter Keevash, Benny Sudakov
CIG
2006
IEEE
11 years 11 months ago
ChessBrain II - A Hierarchical Infrastructure for Distributed Inhomogeneous Speed-Critical Computation
—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...
Colin Frayn, Carlos Justiniano, Kevin Lew
books